Parametric Optimization: Singularities, Pathfollowing and by J. Guddat, F. Guerra Vazquez, H. Th. Jongen

By J. Guddat, F. Guerra Vazquez, H. Th. Jongen

This quantity is meant for readers who, whether or not they be mathematicians, employees in different fields or scholars, are acquainted with the fundamental techniques and strategies of mathematical optimization. the subject material is anxious with optimization difficulties during which a few or all the person info concerned rely on one parameter. Such difficulties are known as one-parametric optimization difficulties. answer algorithms for such difficulties are of curiosity for a number of purposes. We ponder the following mostly purposes of resolution algorithms for one-parametric optimization difficulties within the following fields: (i) globally convergent algorithms for nonlinear, particularly non-convex, optimization difficulties, (ii) international optimization, (iii) multi-objective optimization. the most device for an answer set of rules for a one-parametric optimization challenge would be the so-called pathfollowing tools (also referred to as continuation or homotopy tools) (cf. Chapters three and 4). Classical equipment within the set of desk bound issues can be prolonged to the set of all generalized serious issues. this would be priceless because the course of desk bound issues stops during this set, yet there's a continuation within the broader set of generalized severe issues. besides the fact that, will probably be proven that pathfollowing tools in simple terms aren't winning in each case. for this reason why we advise to leap from one attached part within the set of neighborhood minimizers and generalized serious issues, respectively, to a different one (Chapter 5).

Show description

Read or Download Parametric Optimization: Singularities, Pathfollowing and Jumps PDF

Similar technology books

Fabricated: The New World of 3D Printing

Fabricated tells the tale of 3D printers, humble production machines which are bursting out of the manufacturing unit and into colleges, kitchens, hospitals, even onto the style catwalk. Fabricated describes our rising global of printable items, the place humans layout and 3D print their very own creations as simply as they edit an internet rfile.

Parametric Optimization: Singularities, Pathfollowing and Jumps

This quantity is meant for readers who, whether or not they be mathematicians, employees in different fields or scholars, are conversant in the elemental methods and techniques of mathematical optimization. the subject material is worried with optimization difficulties within which a few or the entire person info concerned depend upon one parameter.

Extra info for Parametric Optimization: Singularities, Pathfollowing and Jumps

Example text

2) by means of the constraint functions hi' iEI, and gj, jEJ. The function f is called the objective function. All functions f, hi, gj are assumed to be taken from c 2 (lRn, IR). c. 2) is linearly dependent. c. 3) IAI + L lAd + iEI L jEJo(x) Illjl > O. Formally, we can define Ilj = 0 for UJ o(x). , IIljgi x)I = O. C. 3) can be chosen to be non-negative (cf. [104]). c. point is also called a point of Fritz-John type. The validity of the constraint qualifications LICQ or MFCQ at a local minimizer x for 11M then implies that A must be positive.

Unless stated otherwise, we assume that the functions f, hi, gj are taken from c 2 (lRn x IR, IR). This setting up is due to Kojima [134J, and Kojima and Hirabayashi [135J, and we refer to these articles for specific details. 4 (cf. 17) ): x D;f(x, t) + m I AiD;hi(x, t) + i~l Yf: L fl/ D;g/x, t) S j~l -h;(x,t),i= 1, ... ,m . 1) flj- -gix,t),j= 1, ... ,s Let w denote the general point in IRn+m+s+l, decomposed as w = (x, A, fl, t)E IR n x IRm x IRS x IR. 18); the factor IR above merely represents the appearance of the parameter t.

4 Type 4 A generalized critical point £ = (x, t) is a point oftype 4 if the following conditions (C1HC6) are fulfilled: (C1) 111+IJ o(£)1>0. In the case J o(z) =I 0, we may assume, after renumbering, that J o(z) = {I, ... , p}. (C2) dim span {DxhM), Dxgj(£), iE1,jEi o(£)} = m + p - 1. (C3) m + p - 1 < n. 1jDxgi£) = 0. 19) are unique up to a common multiple. 1j =I 0, j = 1, ... 1 p = 1 (normalization). 21) Dxgj(i). jEJo(z) Let W be a basis matrix for T. 23) all partial derivatives being evaluated at i .

Download PDF sample

Rated 4.27 of 5 – based on 34 votes