P-FACTOR-APPROACH TO DEGENERATE OPTIMIZATION PROBLEMS

Similar documents
p-regular nonlinearity: tangency at singularity in degenerate optimization problems

HIGHER ORDER IMPLICIT FUNCTION THEOREMS AND DEGENERATE NONLINEAR BOUNDARY-VALUE PROBLEMS. Olga A. Brezhneva. Alexey A. Tret yakov. Jerrold E.

Introduction to Optimization Techniques. Nonlinear Optimization in Function Spaces

1. Introduction. We consider the mathematical programming problem

Pacific Journal of Optimization (Vol. 2, No. 3, September 2006) ABSTRACT

Uniqueness of Generalized Equilibrium for Box Constrained Problems and Applications

In view of (31), the second of these is equal to the identity I on E m, while this, in view of (30), implies that the first can be written

ON REGULARITY CONDITIONS FOR COMPLEMENTARITY PROBLEMS

Lecture 3. Optimization Problems and Iterative Algorithms

Homework Set #6 - Solutions

Constrained Optimization Theory

The Fundamental Theorem of Linear Inequalities

Optimality, Duality, Complementarity for Constrained Optimization

LINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM

March 8, 2010 MATH 408 FINAL EXAM SAMPLE

1. Introduction. Consider the following parameterized optimization problem:

Paul Schrimpf. October 17, UBC Economics 526. Constrained optimization. Paul Schrimpf. First order conditions. Second order conditions

An optimal linear estimation approach to solve systems of linear algebraic equations

Quiz Discussion. IE417: Nonlinear Programming: Lecture 12. Motivation. Why do we care? Jeff Linderoth. 16th March 2006

Solving generalized semi-infinite programs by reduction to simpler problems.

Numerical Optimization

UC Berkeley Department of Electrical Engineering and Computer Science. EECS 227A Nonlinear and Convex Optimization. Solutions 5 Fall 2009

ISM206 Lecture Optimization of Nonlinear Objective with Linear Constraints

Optimization Problems with Constraints - introduction to theory, numerical Methods and applications

LECTURE 16 GAUSS QUADRATURE In general for Newton-Cotes (equispaced interpolation points/ data points/ integration points/ nodes).

Linear Algebra Massoud Malek

A Solution Method for Semidefinite Variational Inequality with Coupled Constraints

SF2822 Applied Nonlinear Optimization. Preparatory question. Lecture 9: Sequential quadratic programming. Anders Forsgren

Perturbation analysis of a class of conic programming problems under Jacobian uniqueness conditions 1

On attraction of linearly constrained Lagrangian methods and of stabilized and quasi-newton SQP methods to critical multipliers

Lecture 1. 1 Conic programming. MA 796S: Convex Optimization and Interior Point Methods October 8, Consider the conic program. min.

Extreme Abridgment of Boyd and Vandenberghe s Convex Optimization

5.6 Penalty method and augmented Lagrangian method

12d. Regular Singular Points

A note on upper Lipschitz stability, error bounds, and critical multipliers for Lipschitz-continuous KKT systems

MATH2070 Optimisation

Local Indices for Degenerate Variational Inequalities

A FRITZ JOHN APPROACH TO FIRST ORDER OPTIMALITY CONDITIONS FOR MATHEMATICAL PROGRAMS WITH EQUILIBRIUM CONSTRAINTS

Lectures 9 and 10: Constrained optimization problems and their optimality conditions

) sm wl t. _.!!... e -pt sinh y t. Vo + mx" + cx' + kx = 0 (26) has a unique tions x(o) solution for t ;?; 0 satisfying given initial condi

Constrained Optimization and Lagrangian Duality

Optimization Theory. Lectures 4-6

On the principle of smooth fit in optimal stopping problems

FIRST- AND SECOND-ORDER OPTIMALITY CONDITIONS FOR MATHEMATICAL PROGRAMS WITH VANISHING CONSTRAINTS 1. Tim Hoheisel and Christian Kanzow

ON A CLASS OF NONSMOOTH COMPOSITE FUNCTIONS

CHAPTER 10 Shape Preserving Properties of B-splines

informs DOI /moor.xxxx.xxxx c 20xx INFORMS

CHARACTERIZATIONS OF LIPSCHITZIAN STABILITY

Introduction to Mathematical Programming IE406. Lecture 10. Dr. Ted Ralphs

Optimality Conditions for Constrained Optimization

1. Introduction The nonlinear complementarity problem (NCP) is to nd a point x 2 IR n such that hx; F (x)i = ; x 2 IR n + ; F (x) 2 IRn + ; where F is

Lecture 13 Newton-type Methods A Newton Method for VIs. October 20, 2008

Here each term has degree 2 (the sum of exponents is 2 for all summands). A quadratic form of three variables looks as

1.2 Derivation. d p f = d p f(x(p)) = x fd p x (= f x x p ). (1) Second, g x x p + g p = 0. d p f = f x g 1. The expression f x gx

Lecture: Algorithms for LP, SOCP and SDP

5 Handling Constraints

EE364a Review Session 5

Nonlinear Programming and the Kuhn-Tucker Conditions

The Implicit and Inverse Function Theorems Notes to supplement Chapter 13.

Sharpening the Karush-John optimality conditions

Math Assignment. Dylan Zwick. Spring Section 2.4-1, 5, 9, 26, 30 Section 3.1-1, 16, 18, 24, 39 Section 3.2-1, 10, 16, 24, 31

Chapter 3. Differentiable Mappings. 1. Differentiable Mappings

Where is matrix multiplication locally open?

minimize x subject to (x 2)(x 4) u,

INTERIOR-POINT METHODS FOR NONCONVEX NONLINEAR PROGRAMMING: COMPLEMENTARITY CONSTRAINTS

I.3. LMI DUALITY. Didier HENRION EECI Graduate School on Control Supélec - Spring 2010

Numerical Optimization of Partial Differential Equations

Convex Optimization & Lagrange Duality

Second Order Optimality Conditions for Constrained Nonlinear Programming

Mathematical Economics. Lecture Notes (in extracts)

EC /11. Math for Microeconomics September Course, Part II Lecture Notes. Course Outline

10 Numerical methods for constrained problems

Course Summary Math 211

1. Introduction. Let P be the orthogonal projection from L2( T ) onto H2( T), where T = {z e C z = 1} and H2(T) is the Hardy space on

Constrained Optimization

Implicit Functions, Curves and Surfaces

Lecture 19 Algorithms for VIs KKT Conditions-based Ideas. November 16, 2008

c 2002 Society for Industrial and Applied Mathematics

Some unified algorithms for finding minimum norm fixed point of nonexpansive semigroups in Hilbert spaces

UNDERGROUND LECTURE NOTES 1: Optimality Conditions for Constrained Optimization Problems

1. Introduction. We consider mathematical programs with equilibrium constraints in the form of complementarity constraints:

y Ray of Half-line or ray through in the direction of y

Introduction to Nonlinear Stochastic Programming

LAGRANGIAN MECHANICS WITHOUT ORDINARY DIFFERENTIAL EQUATIONS

Nonlinear Programming

Written Examination

Support Vector Machines

Lagrange Multipliers

Lagrangian Duality Theory

AN ABADIE-TYPE CONSTRAINT QUALIFICATION FOR MATHEMATICAL PROGRAMS WITH EQUILIBRIUM CONSTRAINTS. Michael L. Flegel and Christian Kanzow

MATH 4211/6211 Optimization Constrained Optimization

Linear DifferentiaL Equation

LECTURE 14: REGULAR SINGULAR POINTS, EULER EQUATIONS

(1) F(x,y, yl, ", y.) 0,

Nonlinear Programming, Elastic Mode, SQP, MPEC, MPCC, complementarity

Critical solutions of nonlinear equations: Stability issues

On the Local Quadratic Convergence of the Primal-Dual Augmented Lagrangian Method

WHEN ARE THE (UN)CONSTRAINED STATIONARY POINTS OF THE IMPLICIT LAGRANGIAN GLOBAL SOLUTIONS?

1. Nonlinear Equations. This lecture note excerpted parts from Michael Heath and Max Gunzburger. f(x) = 0

March 5, 2012 MATH 408 FINAL EXAM SAMPLE

Transcription:

P-FACTOR-APPROACH TO DEGENERATE OPTIMIZATION PROBLEMS 0. A. ~rezhneva,~ and A. A. ~ret'yakov~ ' ~e~artment of Mathematics and Statistics, Miami University, Oxford, OH 45056, USA, Brezhnoa@muohio.edu, 2~enter of the Russian Academy of Sciences, Vavilovn 40, Moscow, GSP-I, Russia and University of Podlasie in Siedlce, 3 Maja, Siedlce, Poland, tret@ap.siedlce.pl Abstract The paper describes and analyzes an application of the p-regularity theory to nonregular, (irregular, degenerate) nonlinear optimization problems. The p- regularity theory, also known as the factor-analysis of nonlinear mappings, has been developing successfully for the last twenty years. The p-factor-approach is based on the construction of a p-factor-operator, which allows us to describe and analyze nonlinear problems in the degenerate case. First, we illustrate how to use the p-factor-approach to solve degenerate optimization problems with equality constraints, in which the Lagrange multiplier associated with the objective function might be equal to zero. We then present necessary and sufficient optimality conditions for a degenerate optimization problem with inequality constraints. The p-factor-approach is also used for solving mathematical programs with equilibrium constraints (MPECs). We show that the constraints are 2-regular at the solution of the MPEC. This property allows us to localize the minimizer independently of the objective function. The same idea is applied to some other nonregular nonlinear programming problems and allows us to reduce these problems to a regular system of equations without an objective function. keywords: Lagrange optimality conditions, degeneracy, p-regularity 1. Introduction The main goal of this paper is to describe and analyze an application of thepregularity theory to nonregular, (irregulal; degenerate) nonlinear optimization problems. In the first part of the paper, we recall some definitions of the p- regularity theory [2,3]. In the second part, we illustrate how to use the p-factorapproach to solve degenerate optimization problems with equality constraints, in which the Lagrange multiplier associated with the objective function might be equal to zero. In the third part, we present necessary and sufficient optimality conditions for a degenerate optimization problem with inequality constraints. In Please use the following format when citing this chapter: Author(s) [insert Last name; First-name initial(s)], 2006, in IFIP International Federation for Information Processing, Volume 199. System Modeling and Optimization, ed~. Ceragioli F.. Dontchev A,, Furuta H., Marti K.; Pandolfi L.; (Boston: Springer), pp. [insert page numbers].

the last part of the paper we consider mathematical programs with equilibrium constraints (MPECs). Notation. Let C(X, Y) be the space of all continuous linear operators from X to Y and for a given linear operator A : X --+ Y, we denote its image by ImA = {y E Y / y = Ax for some x E X). Also, A* : Y* + X* denotes the adjoint of A, where X* and Y* denote the dual spaces of X and Y, respectively. Let p be a natural number and let B : X x X x... x X (with p copies of X) --+ Y be a continuous symmetric p-multilinear mapping. The p-form associated to B is the map B[.]p : X + Y defined by B[x]p = B(x, x,..., x), for x E X. If F : X -+ Y is a differentiable mapping, its derivative at a point x E X will be denoted by Ff(x) : X + Y. If F : X + Y is of class CP, we let F(p) (x) be the pth derivative of F at the point x (a symmetric multilinear map of p copies of X to Y) and the associated p-form, also called the pth-order mapping, is F(p) (x)[h]p = F(P) (x)(h, h,..., h). 2. The p-factor-operator and the p-regular mappings In this section, we recall some definitions of the p-regularity theory [2, 31. Consider a sufficiently smooth mapping F from a Banach space X to a Banach space Y. The mapping F is called regular at some point Z E X if We are interested in the case when the mapping F is nonregular (irregulal; degenerate) at 2, i.e., when We recall the definition of the p-regular mapping and of the p-factor-operator. We construct a p-factor-operator under an assumption that the space Y is decomposed into a direct sum where Yl = cl Irn Ff(Z), Y, = cl Sp (lrnpzz ~ (~'(3) [.li), i = 2,..., p - 1, YP = Zp, Zi is a closed complementary subspace for (Yl 8... $ Y,-l) with respect to Y, i = 2,...,p, and Pzz : Y + Z is the projection operator onto Zi along (Yl $... $ Y,-1) with respect to Y, i = 2,..., p. Define the mappings [2] where Pyj : Y Y is the projection operator onto Y, along (Yl $...8 K-1 $ Y,+l $... 83 Yp) with respect to Y, i = 1,... : p.

The p-factor-operator plays the central role in the p-regularity theory. The number p is chosen as the minimum number for which (2) holds. We give the following definition of the p-factor-operator. DEFINITION 1 The linear operator Qp(h) E C(X, Yl @... @ Yp), defined by Pp(h) = f; (2) + fl(2) [h] +... + f$') (3)[hip-l, h E X, is called a p-factor-operator of the mapping F(x) at the point 2. Now we are ready to introduce another very important definition in the p- regularity theory. DEFINITION 2 We say that the mapping F is p-regular at 5 along an element h if ImQp(h) = Y. The following definition is a specific form of Definition 1 for the case of p=2andf:rn-+rn. DEFINITION 3 A linear operator Q2(h) : Rn -+ Rn, is said to be the 2-factor-operator, where P' is a matrix of the orthoprojector onto (Im F' (z))', which is an orthogonal complementary subspace to the image of the first derivative of F evaluated at 2. The next definition is a specific form of Definition 2. DEFINITION 4 The mapping F is called 2-regular at Z along an element h if 3. Degenerate optimization problems with equality constraints In this section, we consider the nonlinear optimization problem with equality constraints: minimize f (x) subject to F (x) = 0, (4) XEX where f : X -+ R. We will denote a local solution of (4) by 2: We assume that F, f are Cp'l in some neighborhood of 3 and that the mapping F : X -. Y is nonregular at 2, i.e., the condition (1) holds. The Lagrangian for problem (4) is defined as

where (Ao, A) E (R x Y*)\{O) is a generalized Lagrange multiplier. The classical first-order Euler-Lagrange necessary optimality conditions for problem (4) state that there exists a generalized Lagrange multiplier (Xo, X) such that Xo f '(2) + (F1(2))* X = 0, F(I) = 0, A; + 11x112 = 1. In other words, the point (I, Xo, X) is a solution of the following system of equations: We are interested in the case, when the Lagrange multiplier Xo might be equal to zero. In this case, the mapping C and the system (6) are degenerate at (Z,O, X). However, if the mapping L: isp-regular at (I, 0, X) with respect to some vector h, then solving system (6) can be reduced to solving a regular system of equations. This result is stated in the following Theorem 5. Before we give the theorem, introduce the notation z = (x, Xo, A) and the functions li(z) associated with the mapping C(z) introduced in (6). We define functions li (z) by (3) with fi (x) = li(z) and F(x) = C(z). We also define a,(h) to be a p-factor-operator of the mapping L(z) at the point 2 = (I, 0, 1). THEOREM 5 Let I be a solution of (4) and let (0, X) be a generalized Lugrange multiplier such that (3,O, X) is a solution of (6). Assume that the mapping C(z), defined in (6) is p-regular at the point 2 = (I,O, A) with respect to some vector h. Assume also that ~era,(h) = (0). Then the following system has a locally unique regular solution 2: E(z) = 11 (z) + a;(.) [h] +... + ~?-~)[h]~-~ = 0. (7) Example. Consider the problem 3 minimize y subject to F(x, y) = x2 - y = 0: (GY) This problem has a solution (3, Lagrangian for (8) is defined as jj)t = (0, o ) ~ L(x, y, Xo. A) = Aoy + (x2 - y3)x (8) and F'(0,O) = (0,O). The

Then the system (6) for problem (8) has the form This system has a unique degenerate solution (Z,Q, Xo, X) = (0,0,0,1). Since C(x, y, Ao, A) is 3-regular at (O,0, 0, l)t with respect to the vector h = (0,1,0, o)~, we get by Theorem 5 that the system (7) is defined as This system has a locally unique regular solution (0, 0,O, I)~. 4. Optimality conditions for degenerate optimization problems In this section, we consider the nonlinear optimization problem with inequality constraints minimize f (x) subject to g(x) = (gl(x),... : g,(~))~ 2 0, (9) XEX where f, gi : X + R' and X is a Banach space. We will denote a local solution of (9) by 2. For some p 2 2, we say that we have the completely degenerate case if Introduce the sets Hp(2) = {h E X 1 gi (PI(%) [hip > 0, i E I(% and Ip (2, h) = {i E 1(2) I gi (P)(E)[hIp = 0, h E Hp (?)I, Ha = {h E H,(z) / lgi(p)(2) [hipl 5 a, i E I(%); llhll = 1). Introduce the definition.

DEFINITION 6 A mapping g(x) is called strongly p-regular at 5 ifthere exists cr > 0 such that sup li{qp(h)}-'ll < m. h~ H, Let fix some element h E X and introduce the p-factor-lagrangefiinction PI: m Lp(x, h, X(h)) = f (z)- x &(h) g,(p-i) i=l (x)[hjppl. (12) THEOREM 7 Let 3 be a local solution to problem (9). Assume that there exists a vector h, llhli = 1, h E Hp(5), such that the vectors {gi (PI(%) [hlp-l, i E Ip(Z, h)) are linearly independent. Then there exist Lagrange multipliers Xi (h) such that g (3) > 0 Xi (h) > 0, Xi ( h )(2) = 0 i = 1,..., m. Furthermore, suppose that the mapping g(x) is strongly p-regular at 3. If there exist w > 0 and X(h) such that for all h E Hp(I), then 3 is an isolated solution to problem (9). 5. Mathematical programs with equilibrium constraints (MPECs) The MPEC considered in this section is a mathematical program with nonlinear complementary problem (NCP) constraints: minimize f (x) subject to g(x) 2 0, x 2 0, (g(x), x) = 0, (14) where f : Rn -t R, g : Rn i Rn are twice continuously differentiable functions. We are interested in the case when the strict complementarity condition does not hold at the solution 5, i.e., when there exists at least one index j such that gj (3) = 0 and 3, = 0. We show that under a certain condition, the problem (14) can be reduced to solving a system of nonlinear equations, which is independent of the objective function.

By introducing the slack variables sj and $, we reduce (14) to the problem with only equality constraints in the form: System (15) is a system of the 3n equations in the 3n unknowns x, s, and y. The corresponding Jacobian is given by where el,..., en denotes the standard basis in Rn. If there exists an index j such that yj = 0 and sj = 0 (the strict complementarity condition does not hold), then the Jacobian matrix (16) is singular. Assume that we can identify the set lo of the weakly active constraint indices, that is, I. = {i = ll..., n 1 gi(2) = 0 and li = 0). There are different techniques to identify the set lo, for example, ones described in [l] or in [4]. Define the vector h = (hl,... h,) as and a vector h E R~~ as ht = (0:: ht, ht). From the explicit form of the Jacobian (16), the orthoprojector P' onto (Irn F (z, s, y))l in R3n is a diagonal matrix pl = diag(pj);zl that is constant in some neighborhood of (2, S, y) and that is given by P, = 1, i=2n+j, andjeio 0, otherwise.

90 Construct the mapping I I Q(x, s, y) = F(x, s: y) + P F (x, s: y)h. Without loss of generality, we assume that I. = (1,..., r). Then The Jacobian of (17) is nonsingular at (I, 5, y). Consequently the system (17) has a locally unique regular solution (I, 5. y). Thus, we have reduced the solution of the problem (14) to solving system (17) that is independent of the objective function f (x). References [l] F. Facchinei, A. Fisher, andc. Kanzow, On the accurate identificationof active constraints, SlAM J. Optim., 9 (1998), pp. 14-32. [2] A. E Izmailov, and A. A. Tret'yakov, Factor-analysis of nonlinear mappings, Nauka, Moscow, 1994 (in Russian). [3] A. A. Tret'yakov, and J. E. Marsden, Factor-analysis of nonlinear mappings: pregularity theory, Communications on Pure and Applied Analysis, 2 (2003), pp. 425-445. [4] S. J. Wright, An algorithm for degenerate nonlinear programming with rapid local convergence, SIAM Journal on Optimization, 15 (2005), pp. 673-696.