Optimization on Low Rank Nonconvex Structures by Hiroshi Konno

By Hiroshi Konno

Global optimization is among the quickest constructing fields in mathematical optimization. actually, more and more remarkably effective deterministic algorithms were proposed within the final ten years for fixing numerous sessions of enormous scale particularly dependent difficulties encountered in such components as chemical engineering, monetary engineering, position and community optimization, creation and stock regulate, engineering layout, computational geometry, and multi-objective and multi-level optimization.
those new advancements influenced the authors to write down a brand new e-book dedicated to international optimization issues of particular constructions. almost all these difficulties, notwithstanding hugely nonconvex, could be characterised by means of the valuables that they lessen to convex minimization difficulties whilst many of the variables are mounted. a couple of lately built algorithms were proved unusually effective for dealing with average periods of difficulties showing such buildings, particularly low rank nonconvex buildings.
Audience: The e-book will function a primary reference e-book for all those who find themselves attracted to mathematical optimization.

Show description

Read or Download Optimization on Low Rank Nonconvex Structures PDF

Similar linear programming books

Integer Programming: Theory and Practice

Integer Programming: concept and perform includes refereed articles that discover either theoretical features of integer programming in addition to significant purposes. This quantity starts with an outline of recent positive and iterative seek tools for fixing the Boolean optimization challenge (BOOP).

Extrema of Smooth Functions: With Examples from Economic Theory

It isn't an exaggeration to kingdom that the majority difficulties handled in fiscal thought may be formulated as difficulties in optimization idea. This holds precise for the paradigm of "behavioral" optimization within the pursuit of person self pursuits and societally effective source allocation, in addition to for equilibrium paradigms the place life and balance difficulties in dynamics can usually be said as "potential" difficulties in optimization.

Variational and Non-variational Methods in Nonlinear Analysis and Boundary Value Problems

This e-book displays an important a part of authors' learn job dur­ ing the final ten years. the current monograph is built at the effects acquired by way of the authors via their direct cooperation or because of the authors individually or in cooperation with different mathematicians. these kind of effects slot in a unitary scheme giving the constitution of this paintings.

Optimization on Low Rank Nonconvex Structures

International optimization is likely one of the quickest constructing fields in mathematical optimization. in reality, increasingly more remarkably effective deterministic algorithms were proposed within the final ten years for fixing a number of sessions of huge scale particularly dependent difficulties encountered in such parts as chemical engineering, monetary engineering, place and community optimization, construction and stock keep watch over, engineering layout, computational geometry, and multi-objective and multi-level optimization.

Additional info for Optimization on Low Rank Nonconvex Structures

Sample text

A(y) < /(0), conflicting with /(0) = min{/(z) I z ERn}. Thus, the lineality and constancy spaces of f are the same, and consequently, constancy(/)=lineality(/), hence rank(/)=dim(/)-constancy(/) for any proper convex function f E Q. Extending this relation, we define the rank of any function f E Q to be rank(/) = dim(/) - constancy(/). 30 CHAPTER 2 An important notion associated with quasi-convexity is (strongly) even quasiconvexity, introduced independently by Martinez-Legaz (1983) and Passy and Prisman (1984).

A function f: quasi-convex) R" - R is said to be evenly quasi-convex (resp. strongly evenly if the lower level set L~(a) (resp. the strict-lower level set L~ (a)) is evenly convex for any a E Ji. ). It follows from L~(a) = ntl>orL~(/3) that if the strict-lower level sets are evenly convex then so- are the lower level sets. Therefore, a strongly evenly quasi-convex function is evenly quasi-convex. 2 QUASI-CONJUGACY Many types of quasi-conjugacy have been defined in the study of dual representations of general quasi-convex functions (Greenberg and Pierskalla (1970, 1973), Diewert (1974, 1981), Crouzeix (1977, 1983), Martinez-Legaz (1983, 31 Quasi-convexity 1981, 1993), Passy and Prisman (198, 1985), Penot and Volle (1990), ...

Programming problem: k m L L c;;z;; + g(y) + h(z) mmmuze i=l j=l m subject to LZij j=l Yi (i = 1, ... 'k) LZij i=l Zij Zj (j= 1, ... ,m) 0 0 'Vi, j. c. structure of production planning problems arises from the nature of economic processes in which quite often economy of scale (or increasing return) prevails in some sectors, while diseconomy of scale (or decreasing return) prevails in others. 2) we have seen that the problem of determining the optimal site of a facility designed to serve n users located at given points a 1 , ...

Download PDF sample

Rated 4.65 of 5 – based on 17 votes