Results 1  10
of
25
Local convergence of SQP methods for Mathematical Programs with Equilibrium Constraints
, 2002
"... Recently, it has been shown that Nonlinear Programming solvers can successfully solve a range of Mathematical Programs with Equilibrium Constraints (MPECs). ..."
Abstract

Cited by 72 (19 self)
 Add to MetaCart
(Show Context)
Recently, it has been shown that Nonlinear Programming solvers can successfully solve a range of Mathematical Programs with Equilibrium Constraints (MPECs).
Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
 SIAM Journal on Optimization
, 1997
"... Mathematical programs with nonlinear complementarity constraints are reformulated using betterposed but nonsmooth constraints. We introduce a class of functions, parameterized by a real scalar, to approximate these nonsmooth problems by smooth nonlinear programs. This smoothing procedure has the ex ..."
Abstract

Cited by 47 (0 self)
 Add to MetaCart
(Show Context)
Mathematical programs with nonlinear complementarity constraints are reformulated using betterposed but nonsmooth constraints. We introduce a class of functions, parameterized by a real scalar, to approximate these nonsmooth problems by smooth nonlinear programs. This smoothing procedure has the extra benefits that it often improves the prospect of feasibility and stability of the constraints of the associated nonlinear programs and their quadratic approximations. We present two globally convergent algorithms based on sequential quadratic programming, SQP, as applied in exact penalty methods for nonlinear programs. Global convergence of the implicit smooth SQP method depends on existence of a lowerlevel nondegenerate (strictly complementary) limit point of the iteration sequence. Global convergence of the explicit smooth SQP method depends on a weaker property, i.e. existence of a limit point at which a generalized constraint qualification holds. We also discuss some practical matter...
Complementarity Constraint Qualifications and Simplified BStationarity Conditions for Mathematical Programs with Equilibrium Constraints
, 1998
"... With the aid of some novel complementarity constraint qualifications, we derive some simplied primaldual characterizations of a Bstationary point for a mathematical program with complementarity constraints (MPEC). The approach is based on a locally equivalent piecewise formulation of such a prog ..."
Abstract

Cited by 31 (6 self)
 Add to MetaCart
With the aid of some novel complementarity constraint qualifications, we derive some simplied primaldual characterizations of a Bstationary point for a mathematical program with complementarity constraints (MPEC). The approach is based on a locally equivalent piecewise formulation of such a program near a feasible point. The simplied results, which rely heavily on a careful dissection and improved understanding of the tangent cone of the feasible region of the program, bypass the combinatorial characterization that is intrinsic to Bstationarity.
An implementable activeset algorithm for computing a Bstationary point of a mathematical program with linear complementarity constraints
 SIAM J. Optim
"... Abstract. In [3], an ɛactive set algorithm was proposed for solving a mathematical program with a smooth objective function and linear inequality/complementarity constraints. It is asserted therein that, under a uniform LICQ on the ɛfeasible set, this algorithm generates iterates whose cluster poi ..."
Abstract

Cited by 30 (4 self)
 Add to MetaCart
(Show Context)
Abstract. In [3], an ɛactive set algorithm was proposed for solving a mathematical program with a smooth objective function and linear inequality/complementarity constraints. It is asserted therein that, under a uniform LICQ on the ɛfeasible set, this algorithm generates iterates whose cluster points are Bstationary points of the problem. However, the proof has a gap and only shows that each cluster point is an Mstationary point. We discuss this gap and show that Bstationarity can be achieved if the algorithm is modified and an additional error bound condition holds. Key words. MPEC, Bstationary point, ɛactive set, error bound AMS subject classifications. 65K05, 90C30, 90C33
Some properties of regularization and penalization schemes for MPECs
 Optimization Methods and Software
, 2004
"... Abstract. Some properties of regularized and penalized nonlinear programming formulations of mathematical programs with equilibrium constraints (MPECs) are described. The focus is on the properties of these formulations near a local solution of the MPEC at which strong stationarity and a secondorde ..."
Abstract

Cited by 30 (2 self)
 Add to MetaCart
(Show Context)
Abstract. Some properties of regularized and penalized nonlinear programming formulations of mathematical programs with equilibrium constraints (MPECs) are described. The focus is on the properties of these formulations near a local solution of the MPEC at which strong stationarity and a secondorder sufficient condition are satisfied. In the regularized formulations, the complementarity condition is replaced by a constraint involving a positive parameter that can be decreased to zero. In the penalized formulation, the complementarity constraint appears as a penalty term in the objective. Existence and uniqueness of solutions for these formulations are investigated, and estimates are obtained for the distance of these solutions to the MPEC solution under various assumptions.
Modeling and computing twosettlement oligopolistic equilibrium in a congested electricity network
 Operations Research
, 2008
"... A model of twosettlement electricity markets is introduced, which accounts for flow congestion, demand uncertainty, system contingencies and market power. We formulate the subgame perfect Nash equilibrium for this model as an equilibrium problem with equilibrium constraints (EPEC), in which each fi ..."
Abstract

Cited by 27 (2 self)
 Add to MetaCart
(Show Context)
A model of twosettlement electricity markets is introduced, which accounts for flow congestion, demand uncertainty, system contingencies and market power. We formulate the subgame perfect Nash equilibrium for this model as an equilibrium problem with equilibrium constraints (EPEC), in which each firm solves a mathematical program with equilibrium constraints (MPEC). The model assumes linear demand functions, quadratic generation cost functions and a lossless DC network, resulting in equilibrium constraints as a parametric linear complementarity problem (LCP). We introduce an iterative procedure for solving this EPEC through repeated application of an MPEC algorithm. This MPEC algorithm is based on solving quadratic programming subproblems and on parametric LCP pivoting. Numerical examples demonstrate the effectiveness of the MPEC and EPEC algorithms and the tractability of the model for realistic size power systems. 1
Piecewise Sequential Quadratic Programming For Mathematical Programs With . . .
"... We describe some first and secondorder optimality conditions for mathematical programs with equilibrium constraints (MPEC). Mathematical programs with parametric nonlinear complementarity constraints are the focus. Of interest is the result that under a linear independence assumption that is stand ..."
Abstract

Cited by 18 (9 self)
 Add to MetaCart
We describe some first and secondorder optimality conditions for mathematical programs with equilibrium constraints (MPEC). Mathematical programs with parametric nonlinear complementarity constraints are the focus. Of interest is the result that under a linear independence assumption that is standard in nonlinear programming, the otherwise combinatorial problem of checking whether a point is stationary for an MPEC is reduced to checking stationarity of single nonlinear program. We also present a piecewise sequential quadratic programming (PSQP) algorithm for solving MPEC. Local quadratic convergence is shown under the linear independence assumption and a secondorder sufficient condition. Some computational results are given. KEY WORDS MPEC, bilevel program, nonlinear complementarity problem, nonlinear program, first and secondorder optimality conditions, linear independence constraint qualification, sequential quadratic programming, quadratic convergence. 2 Chapter 1 1 INTRODUC...
Complementarity constraints as nonlinear equations: Theory and numerical experience
 Preprint ANL/MCSP10540603, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne
, 2003
"... Recently, it has been shown that mathematical programs with complementarity constraints (MPCCs) can be solved efficiently and reliably as nonlinear programs. This paper examines various nonlinear formulations of the complementarity constraints. Several nonlinear complementarity functions are conside ..."
Abstract

Cited by 18 (8 self)
 Add to MetaCart
(Show Context)
Recently, it has been shown that mathematical programs with complementarity constraints (MPCCs) can be solved efficiently and reliably as nonlinear programs. This paper examines various nonlinear formulations of the complementarity constraints. Several nonlinear complementarity functions are considered for use in MPCC. Unlike standard smoothing techniques, however, the reformulations do not require the control of a smoothing parameter. Thus they have the advantage that the smoothing is exact in the sense that KarushKuhnTucker points of the reformulation correspond to strongly stationary points of the MPCC. A new exact smoothing of the wellknown min function is also introduced and shown to possess desirable theoretical properties. It is shown how the new formulations can be integrated into a sequential quadratic programming solver, and their practical performance is compared on a range of test problems.
Examples of dual behaviour of Newtontype methods on optimization problems with degenerate constraints
 Computational Optimization and Applications
"... discuss possible scenarios of behaviour of the dual part of sequences generated by primaldual Newtontype methods when applied to optimization problems with nonunique multipliers associated to a solution. Those scenarios are: (a) failure of convergence of the dual sequence; (b) convergence to a so ..."
Abstract

Cited by 16 (10 self)
 Add to MetaCart
discuss possible scenarios of behaviour of the dual part of sequences generated by primaldual Newtontype methods when applied to optimization problems with nonunique multipliers associated to a solution. Those scenarios are: (a) failure of convergence of the dual sequence; (b) convergence to a socalled critical multiplier (which, in particular, violates some secondorder sufficient conditions for optimality), the latter appearing to be a typical scenario when critical multipliers exist; (c) convergence to a noncritical multiplier. The case of mathematical programs with complementarity constraints is also discussed. We illustrate those scenarios with examples, and discuss consequences for the speed of convergence. We also put together a collection of examples of optimization problems with constraints violating some standard constraint qualifications, intended for preliminary testing of existing algorithms on degenerate problems, or for developing special new algorithms designed to deal with constraints degeneracy. Keywords Degenerate constraints · Secondorder sufficiency · Newton method · SQP
A robust SQP method for mathematical programs with linear complementarity constraints
 Computational Optimization and Applications
, 2003
"... Abstract. The relationship between the mathematical program with linear complementarity constraints (MPCC) and its inequality relaxation is studied. A new sequential quadratic programming (SQP) method is presented for solving the MPCC based on this relationship. A certain SQP technique is introduced ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
Abstract. The relationship between the mathematical program with linear complementarity constraints (MPCC) and its inequality relaxation is studied. A new sequential quadratic programming (SQP) method is presented for solving the MPCC based on this relationship. A certain SQP technique is introduced to deal with the possible infeasibility of quadratic programming subproblems. Global convergence results are derived without assuming the linear independence constraint qualification for MPEC and nondegeneracy of the complementarity constraints. Preliminary numerical results are reported. Key words: mathematical programs with equilibrium constraints, sequential quadratic programming, complementarity, constraint qualification, degeneracy