Results 1  10
of
13
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 22 (4 self)
 Add to MetaCart
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
THE THEORY OF 2REGULARITY FOR MAPPINGS WITH LIPSCHITZIAN DERIVATIVES AND ITS APPLICATIONS TO OPTIMALITY CONDITIONS
, 2002
"... We study local structure of a nonlinear mapping near points where standard regularity and/or smoothness assumptions need not be satisfied. We introduce a new concept of 2regularity (a certain kind of secondorder regularity) for a once differentiable mapping whose derivative is Lipschitz continuous ..."
Abstract

Cited by 17 (15 self)
 Add to MetaCart
We study local structure of a nonlinear mapping near points where standard regularity and/or smoothness assumptions need not be satisfied. We introduce a new concept of 2regularity (a certain kind of secondorder regularity) for a once differentiable mapping whose derivative is Lipschitz continuous. Under this 2regularity condition, we obtain the representation theorem and the covering theorem (i.e., stability with respect to “righthand side ” perturbations) under assumptions that are weaker than those previously employed in the literature for results of this type. These results are further used to derive a constructive description of the tangent cone to a set defined by (2regular) equality constraints and optimality conditions for related optimization problems. The class of mappings introduced and studied in the paper appears to be a convenient tool for treating complementarity structures by means of an appropriate equationbased reformulation. Optimality conditions for mathematical programs with (equivalently reformulated) complementarity constraints are also discussed.
Generalized stationary points and an interiorpoint method for mathematical programs with equilibrium constraints
 Industrial Engineering & Management Sciences, Northwestern University
, 2005
"... Abstract. Generalized stationary points of the mathematical program with equilibrium constraints (MPEC) are studied to better describe the limit points produced by interior point methods for MPEC. A primaldual interiorpoint method is then proposed, which solves a sequence of relaxed barrier proble ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
Abstract. Generalized stationary points of the mathematical program with equilibrium constraints (MPEC) are studied to better describe the limit points produced by interior point methods for MPEC. A primaldual interiorpoint method is then proposed, which solves a sequence of relaxed barrier problems derived from MPEC. Global convergence results are deduced without assuming strict complementarity or the linear independence constraint qualification for MPEC (MPECLICQ). Under certain general assumptions, the algorithm can always find some point with strong or weak stationarity. In particular, it is shown that every limit point of the generated sequence is a strong stationary point of MPEC if the penalty parameter of the merit function is bounded. Otherwise, a certain point with weak stationarity can be obtained. Preliminary numerical results are reported, which include a case analyzed by Leyffer for which the penalty interiorpoint algorithm failed to find a stationary point. Key words: Global convergence, interiorpoint methods, mathematical programming with equilibrium constraints, stationary point
Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
, 2005
"... ..."
Smoothing Implicit Programming Approaches For Stochastic Mathematical Programs With Linear Complementarity Constraints
, 2003
"... In this paper, we consider the stochastic mathematical program with equilibrium constraints (SMPEC) , which can be thought as a generalization of the mathematical program with equilibrium constraints. Many decision problems can be formulated as SMPECs in practice. We discuss both lowerlevel waitan ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
In this paper, we consider the stochastic mathematical program with equilibrium constraints (SMPEC) , which can be thought as a generalization of the mathematical program with equilibrium constraints. Many decision problems can be formulated as SMPECs in practice. We discuss both lowerlevel waitandsee and hereand now decision problems. For the lowerlevel waitandsee model, we propose a smoothing implicit programming method and establish a comprehensive convergence theory. For the hereandnow decision problem, we apply a penalty technique and suggest a similar method. We show that the two methods possess similar convergence properties.
Complementarity constraint qualification via the theory of secondorder regularity
 SIAM J. Optim. Forthcoming
, 1999
"... Abstract. We exhibit certain secondorder regularity properties ofparametric complementarity constraints, which are notorious for being irregular in the classical sense. Our approach leads to a constraint qualification in terms of2regularity ofthe mapping corresponding to the subset ofconstraints w ..."
Abstract

Cited by 6 (6 self)
 Add to MetaCart
Abstract. We exhibit certain secondorder regularity properties ofparametric complementarity constraints, which are notorious for being irregular in the classical sense. Our approach leads to a constraint qualification in terms of2regularity ofthe mapping corresponding to the subset ofconstraints which must be satisfied as equalities around the given feasible point, while no qualification is required for the rest of the constraints. Under this 2regularity assumption, we derive constructive sufficient conditions for tangent directions to feasible sets defined by complementarity constraints. A special form of primaldual optimality conditions is also obtained. We further show that our 2regularity condition always holds under the piecewise Mangasarian–Fromovitz constraint qualification, but not vice versa. Relations with other constraint qualifications and optimality conditions are also discussed. It is shown that our approach can be useful when alternative ones are not applicable.
On the Global Solution of Linear Programs with Linear Complementarity Constraints
, 2007
"... This paper presents a parameterfree integerprogramming based algorithm for the global resolution of a linear program with linear complementarity constraints (LPEC). The cornerstone of the algorithm is a minimax integer program formulation that characterizes and provides certificates for the three ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
This paper presents a parameterfree integerprogramming based algorithm for the global resolution of a linear program with linear complementarity constraints (LPEC). The cornerstone of the algorithm is a minimax integer program formulation that characterizes and provides certificates for the three outcomes—infeasibility, unboundedness, or solvability—of an LPEC. An extreme point/ray generation scheme in the spirit of Benders decomposition is developed, from which valid inequalities in the form of satisfiability constraints are obtained. The feasibility problem of these inequalities and the carefully guided linear programming relaxations of the LPEC are the workhorse of the algorithm, which also employs a specialized procedure for the sparsification of the satifiability cuts. We establish the finite termination of the algorithm and report computational results using the algorithm for solving randomly generated LPECs of reasonable sizes. The results establish that the algorithm can handle infeasible, unbounded, and solvable LPECs effectively.
A Hybrid Algorithm with Active Set Identification for Mathematical Programs with Complementarity Constraints
, 2002
"... We consider a mathematical program with complementarity constraints (MPCC). Our purpose is to develop methods that enable us to compute a solution or a point with some kind of stationarity to MPCC by solving a finite number of nonlinear programs. To this end, we first introduce an active set identif ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We consider a mathematical program with complementarity constraints (MPCC). Our purpose is to develop methods that enable us to compute a solution or a point with some kind of stationarity to MPCC by solving a finite number of nonlinear programs. To this end, we first introduce an active set identification technique. Then, by applying this technique to a smoothing continuation method presented by Fukushima and Pang (1999), we propose a hybrid method for solving MPCC. Under reasonable assumptions, the hybrid algorithm is shown to possess a finite termination property. Numerical experience shows that the proposed approach is quite e#ective.
A Sequential NCP Algorithm for Solving Equilibrium Problems with Equilibrium Constraints
"... Abstract. This paper studies algorithms for equilibrium problems with equilibrium constraints (EPECs). We present a generalization of Scholtes’s regularization scheme for MPECs and extend his convergence results to this new relaxation method. We propose a sequential nonlinear complementarity (SNCP) ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract. This paper studies algorithms for equilibrium problems with equilibrium constraints (EPECs). We present a generalization of Scholtes’s regularization scheme for MPECs and extend his convergence results to this new relaxation method. We propose a sequential nonlinear complementarity (SNCP) algorithm to solve EPECs and establish the convergence of this algorithm. We present numerical results comparing the SNCP algorithm and diagonalization (nonlinear GaussSeidel and nonlinear Jacobi) methods on randomly generated EPEC test problems. The computational experience to date shows that both the SNCP algorithm and the nonlinear GaussSeidel method outperform the nonlinear Jacobi method. 1
A TrustRegion Method for Nonlinear Bilevel Programming: Algorithm and Computational Experience
, 2005
"... We consider the approximation of nonlinear bilevel mathematical programs by solvable programs of the same type, i.e., bilevel programs involving linear approximations of the upperlevel objective and all constraintdefining functions, as well as a quadratic approximation of the lowerlevel objective ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We consider the approximation of nonlinear bilevel mathematical programs by solvable programs of the same type, i.e., bilevel programs involving linear approximations of the upperlevel objective and all constraintdefining functions, as well as a quadratic approximation of the lowerlevel objective. We describe the main features of the algorithm and the resulting software. Numerical experiments tend to confirm the promising behavior of the method.