Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints

DOI10.1007/BF02592205zbMath0870.90092OpenAlexW1994229564MaRDI QIDQ2365344

Shiquan Wu, Daniel Ralph, Jong-Shi Pang, Zhi-Quan Luo

Publication date: 25 August 1997

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02592205

zbMATH Keywords

optimality conditionserror boundsexact penalizationequilibrium programshierarchical programsparametric normal equationssubanalytic constraints

Mathematics Subject Classification ID

Nonlinear programming (90C30) Nonsmooth analysis (49J52)

Related Items

A DC Algorithm for Solving Quadratic-linear Bilevel Optimization Problems, Mordukhovich stationarity for mathematical programs with switching constraints under weak constraint qualifications, Convergence rate estimates for penalty methods revisited, Convergence of an Inexact Smoothing Method for Mathematical Programs with Equilibrium Constraints, Mathematical Programs with Equilibrium Constraints: A Brief Survey of Methods and Optimality Conditions, Coupled versus decoupled penalization of control complementarity constraints, Unnamed Item, Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder), A class of quadratic programs with linear complementarity constraints, A superlinearly convergent SQP algorithm for mathematical programs with linear complementarity constraints, DC programming techniques for solving a class of nonlinear bilevel programs, An inexact-restoration method for nonlinear bilevel programming problems, On convex quadratic programs with linear complementarity constraints, Analysis of M-stationary points to an EPEC modeling oligopolistic competition in an electricity spot market, Sensitivity analysis of composite piecewise smooth equations, Global convergence of a smooth approximation method for mathematical programs with complementarity constraints, Error bounds in mathematical programming, Global optimization for transport network expansion and signal setting, A relaxed constant positive linear dependence constraint qualification for mathematical programs with equilibrium constraints, Complementarity formulations and existence of solutions of dynamic multi-rigid-body contact problems with Coulomb friction, Second-order analysis of penalty function, Three modeling paradigms in mathematical programming, On regular coderivatives in parametric equilibria with non-unique multipliers, Krasnoselski-Mann iterations for hierarchical fixed point problems for a finite family of nonself mappings in Banach spaces, \(l_{p}\)-norm regularization method (\( 0<p<1 \)) and DC programming for correction system of inconsistency linear inequalities, Implications of the constant rank constraint qualification, On penalty and gap function methods for bilevel equilibrium problems, An iterative algorithm for a hierarchical problem, Stability analysis of one stage stochastic mathematical programs with complementarity constraints, Levitin-Polyak well-posedness for optimization problems with generalized equilibrium constraints, Unnamed Item, An exact penalty approach for optimization with nonnegative orthogonality constraints, Mathematical programming approaches for the safety assessment of semirigid elastoplastic frames, New relaxation method for mathematical programs with complementarity constraints, On the convergence of coderivative of SAA solution mapping for a parametric stochastic generalized equation, Exact penalty and error bounds in DC programming, On the convergence of coderivative of SAA solution mapping for a parametric stochastic variational inequality, An objective penalty function of bilevel programming, Bounded sets of KKT multipliers in vector optimization, \(\alpha\)-well-posedness for Nash equilibria and for optimization problems with Nash equilibrium constraints, Notes on some constraint qualifications for mathematical programs with equilibrium constraints, A two-level distributed algorithm for nonconvex constrained optimization, Optimization under generalized equation constraints in Asplund spaces, A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints, Smoothing approach to Nash equilibrium formulations for a class of equilibrium problems with shared complementarity constraints, Bilevel invex equilibrium problems with applications, Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints, On the solution of a minimum weight elastoplastic problem involving displacement and complementarity constraints, Exact penalization and necessary optimality conditions for multiobjective optimization problems with equilibrium constraints, A smoothing Newton method for mathematical programs constrained by parameterized quasi-variational inequalities, Semicontinuity of solution sets to parametric quasivariational inclusions with applications to traffic networks. I: Upper semicontinuities, Iterative methods for triple hierarchical variational inequalities in Hilbert spaces, Algorithms for a class of bilevel programs involving pseudomonotone variational inequalities, A new smoothing technique for mathematical programs with equilibrium constraints, A \(\mathcal{UV}\)-decomposed method for solving an MPEC problem, Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs, New branch-and-Cut algorithm for bilevel linear programming, Exact penalty method for the nonlinear bilevel programming problem, Quasiconvex minimization on a locally finite union of convex sets, Optimization approaches to supervised classification, Solving stochastic mathematical programs with equilibrium constraints via approximation and smoothing implicit programming with penalization, Subgradients of marginal functions in parametric mathematical programming, Multiobjective optimization problems with equilibrium constraints, A solution method for semivectorial bilevel programming problem via penalty method, Necessary and sufficient conditions for linear suboptimality in constrained optimization, A nonconvex dissipative system and its applications. I, Iterative algorithm for solving triple-hierarchical constrained optimization problem, On the robustness of global optima and stationary solutions to stochastic mathematical programs with equilibrium constraints. I: Theory, Merit-function piecewise SQP algorithm for mathematical programs with equilibrium constraints, Parametrized variational inequality approaches to generalized Nash equilibrium problems with shared constraints, Stationarity conditions and their reformulations for mathematical programs with vertical complementarity constraints, Controlled predatory pricing in a multiperiod Stackelberg game: an MPEC approach, Approximating stationary points of stochastic mathematical programs with equilibrium constraints via sample averaging, Implicit solution function of P\(_{0}\) and Z matrix linear complementarity constraints, Global Lipschitzian error bounds for semidefinite complementarity problems with emphasis on NCPs, Active set algorithm for mathematical programs with linear complementarity constraints, Optimization problems with equilibrium constraints and their numerical solution., A globally convergent approximately active search algorithm for solving mathematical programs with linear complementarity constraints, Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints, Generalized limit analysis in poroplasticity by mathematical programming, Solving mathematical programs with complementarity constraints as nonlinear programs, A modified relaxation scheme for mathematical programs with complementarity constraints, On the convergence properties of modified augmented Lagrangian methods for mathematical programming with complementarity constraints, Convergence properties of modified and partially-augmented Lagrangian methods for mathematical programs with complementarity constraints, Global optimization method for solving mathematical programs with linear complementarity constraints, Smoothing methods for nonsmooth, nonconvex minimization, Two new weak constraint qualifications for mathematical programs with equilibrium constraints and applications, Exact penalty functions and calmness for mathematical programming under nonlinear perturbations, Optimality conditions for nonsmooth mathematical programs with equilibrium constraints, using convexificators, A robust SQP method for mathematical programs with linear complementarity constraints, On Efficiency Conditions for Nonsmooth Vector Equilibrium Problems with Equilibrium Constraints, Error bounds via exact penalization with applications to concave and quadratic systems, Partial exact penalty for mathematical programs with equilibrium constraints, A unifying theory of exactness of linear penalty functions, DC Programming Approach for a Class of Nonconvex Programs Involving l 0 Norm, Characterizations of linear suboptimality for mathematical programs with equilibrium constraints, Solving bilevel linear programs using multiple objective linear programming, Hybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mapping, Convergence properties of a smoothing approach for mathematical programs with second-order cone complementarity constraints, Well-posedness for equilibrium problems and for optimization problems with equilibrium constraints, Two-step iterative algorithms for hierarchical fixed point problems and variational inequality problems, DC programming and DCA for globally solving the value-at-risk, On some regularity properties in variational analysis, Collusive game solutions via optimization, A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints, Tikhonov regularization for mathematical programs with generalized complementarity constraints, A simplex approach for finding local solutions of a linear bilevel program by equilibrium points

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Introduction to sensitivity and stability analysis in nonlinear programming
• Existence of optimal solutions to mathematical programs with equilibrium constraints
• A simple characterization of solutions sets of convex programs
• Convex two-level optimization
• Semianalytic and subanalytic sets
• Hierarchical optimization: An introduction
• A degree-theoretic approach to parametric nonsmooth equations with multivalued perturbed solution sets
• Error bounds for analytic systems and their applications
• Exact and inexact penalty methods for the generalized bilevel programming problem
• Directional derivatives of the solution of a parametric nonlinear program
• The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
• Piecewise Ck functions in nonsmooth analysis
• Newton's Method for B-Differentiable Equations
• A solution method for the static constrained Stackelberg problem via penalty method
• Optimality conditions for the bilevel programming problem
• Directional derivative of the marginal function in nonlinear programming
• An Algorithm for Solving the General Bilevel Programming Problem
• On uniqueness of Kuhn-Tucker multipliers in nonlinear programming
• Optimization and nonsmooth analysis
• Network design problem with congestion effects: A case of bilevel programming
• Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity
• Strongly Regular Generalized Equations
• Some continuity properties of polyhedral multifunctions
• Generalized equations and their solutions, part II: Applications to nonlinear programming
• An Exact Penalization Viewpoint of Constrained Optimization
• An Implicit-Function Theorem for a Class of Nonsmooth Functions
• A Necessary and Sufficient Condition for a Constrained Minimum
• Normal Maps Induced by Linear Transformations
• A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
• On Optimization Problems with Variational Inequality Constraints
• Problems of Hierarchical Optimization in Finite Dimensions
• A necessary and a sufficient optimality condition for bilevel programming problems
• Penalty functions in subanalytic optimization
• Stability Analysis of Variational Inequalities and Nonlinear Complementarity Problems, via the Mixed Linear Complementarity Problem and Degree Theory
• Optimality conditions for bilevel programming problems
• Piecewise Smoothness, Local Invertibility, and Parametric Analysis of Normal Maps
• Sufficiency of Exact Penalty Minimization
• Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
• On the basic theorem of complementarity
• Sur le problème de la division
• A solution method for the linear static Stackelberg problem using penalty functions