On the public citation graph
Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
0 signed · 152 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/nav.3800310104openalex-snapshot
Optimality conditions for the bilevel programming problem
inferredcites →https://doi.org/10.1007/978-0-387-74759-0_333openalex-snapshot
Linear Complementarity Problem
inferredcites →https://doi.org/10.1007/978-1-4615-2025-2openalex-snapshot
Handbook of Global Optimization
inferredcites →https://doi.org/10.1007/bf01580580openalex-snapshot
Network design problem with congestion effects: A case of bilevel programming
inferredcites →https://doi.org/10.1007/bf01582210openalex-snapshot
Error bounds for analytic systems and their applications
inferredcites →https://doi.org/10.1007/bf01584073openalex-snapshot
On the basic theorem of complementarity
inferredcites →https://doi.org/10.1007/bf01585174openalex-snapshot
A degree-theoretic approach to parametric nonsmooth equations with multivalued perturbed solution sets
inferredcites →https://doi.org/10.1007/bf01585934openalex-snapshot
Directional derivatives of the solution of a parametric nonlinear program
inferredcites →https://doi.org/10.1007/bf01586095openalex-snapshot
On uniqueness of Kuhn-Tucker multipliers in nonlinear programming
inferredcites →https://doi.org/10.1007/bf01588784openalex-snapshot
Corrigenda to “Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity”
inferredcites →https://doi.org/10.1007/bf01593777openalex-snapshot
A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
inferredcites →https://doi.org/10.1007/bf02098169openalex-snapshot
Hierarchical optimization: An introduction
inferredcites →https://doi.org/10.1007/bf02592209openalex-snapshot
Exact and inexact penalty methods for the generalized bilevel programming problem
inferredcites →https://doi.org/10.1007/bfb0120929openalex-snapshot
Some continuity properties of polyhedral multifunctions
inferredcites →https://doi.org/10.1007/bfb0120989openalex-snapshot
Generalized equations and their solutions, part II: Applications to nonlinear programming
inferredcites →https://doi.org/10.1007/bfb0121154openalex-snapshot
Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity
inferredcites →https://doi.org/10.1007/bfb0121214openalex-snapshot
Directional derivative of the marginal function in nonlinear programming
inferredcites →https://doi.org/10.1007/springerreference_5340openalex-snapshot
Complementarity problems
inferredcites →https://doi.org/10.1016/0022-247x(67)90163-1openalex-snapshot
The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
inferredcites →https://doi.org/10.1016/0167-6377(88)90047-8openalex-snapshot
A simple characterization of solution sets of convex programs
inferredcites →https://doi.org/10.1016/0167-6377(88)90066-1openalex-snapshot
Existence of optimal solutions to mathematical programs with equilibrium constraints
inferredcites →https://doi.org/10.1016/0362-546x(90)90005-2openalex-snapshot
Piecewise Ck functions in nonsmooth analysis
inferredcites →https://doi.org/10.1016/b978-0-12-590240-3.50009-4openalex-snapshot
Strongly Stable Stationary Solutions in Nonlinear Programs
inferredcites →https://doi.org/10.1016/s0076-5392(08)x6041-2openalex-snapshot
Introduction to Sensitivity and Stability Analysis in Nonlinear Programming
inferredcites →https://doi.org/10.1080/02331939208843831openalex-snapshot
A necessary and a sufficient optimality condition for bilevel programming problems
inferredcites →https://doi.org/10.1080/02331939208843840openalex-snapshot
Penalty functions in subanalytic optimization
inferredcites →https://doi.org/10.1080/02331939508844060openalex-snapshot
Optimality conditions for bilevel programming problems
inferredcites →https://doi.org/10.1109/9.58565openalex-snapshot
A solution method for the linear static Stackelberg problem using penalty functions
inferredcites →https://doi.org/10.1109/tac.1984.1103455openalex-snapshot
A solution method for the static constrained Stackelberg problem via penalty method
inferredcites →https://doi.org/10.1137/0307016openalex-snapshot
Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
inferredcites →https://doi.org/10.1137/0323003openalex-snapshot
Sufficiency of Exact Penalty Minimization
inferredcites →https://doi.org/10.1137/0329054openalex-snapshot
An Exact Penalization Viewpoint of Constrained Optimization
inferredcites →https://doi.org/10.1137/0802033openalex-snapshot
A Necessary and Sufficient Condition for a Constrained Minimum
inferredcites →https://doi.org/10.1137/0804019openalex-snapshot
On Optimization Problems with Variational Inequality Constraints
inferredcites →https://doi.org/10.1137/0804029openalex-snapshot
Problems of Hierarchical Optimization in Finite Dimensions
inferredcites →https://doi.org/10.1137/1.9780898719000openalex-snapshot
The Linear Complementarity Problem
inferredcites →https://doi.org/10.1137/1.9780898719468openalex-snapshot
Iterative Solution of Nonlinear Equations in Several Variables
inferredcites →https://doi.org/10.1137/1.9781611971309openalex-snapshot
Optimization and Nonsmooth Analysis
inferredcites →https://doi.org/10.1287/moor.15.2.311openalex-snapshot
Newton's Method for B-Differentiable Equations
inferredcites →https://doi.org/10.1287/moor.16.2.292openalex-snapshot
An Implicit-Function Theorem for a Class of Nonsmooth Functions
inferredcites →https://doi.org/10.1287/moor.17.3.691openalex-snapshot
Normal Maps Induced by Linear Transformations
inferredcites →https://doi.org/10.1287/moor.19.4.831openalex-snapshot
Stability Analysis of Variational Inequalities and Nonlinear Complementarity Problems, via the Mixed Linear Complementarity Problem and Degree Theory
inferredcites →https://doi.org/10.1287/moor.21.2.401openalex-snapshot
Piecewise Smoothness, Local Invertibility, and Parametric Analysis of Normal Maps
inferredcites →https://doi.org/10.1287/moor.5.1.43openalex-snapshot
Strongly Regular Generalized Equations
inferredcites →https://doi.org/10.1287/moor.8.2.260openalex-snapshot
An Algorithm for Solving the General Bilevel Programming Problem
inferredcites →https://doi.org/10.2307/2004942openalex-snapshot
Iterative Solution of Nonlinear Equations in Several Variables
inferredcites →https://doi.org/10.4064/sm-18-1-87-136openalex-snapshot
Sur le problème de la division
inferredcites →https://doi.org/10.6028/jres.049.027openalex-snapshot
On approximate solutions of systems of linear inequalities
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4613-0307-7_12openalex-snapshot
An Implicit Function Approach to Bilevel Programming Problems
inferred← citeshttps://doi.org/10.1007/978-1-4613-0307-7_14openalex-snapshot
Existence of Solutions to Generalized Bilevel Programming Problem
inferred← citeshttps://doi.org/10.1007/978-1-4613-3341-8_3openalex-snapshot
Error Bounds for Convex Inequality Systems
inferred← citeshttps://doi.org/10.1007/978-1-4614-5131-0_4openalex-snapshot
Mathematical Programs with Equilibrium Constraints: A Brief Survey of Methods and Optimality Conditions
inferred← citeshttps://doi.org/10.1007/978-1-4757-3216-0_16openalex-snapshot
Error Bounds for Quadratic Systems
inferred← citeshttps://doi.org/10.1007/978-1-4757-3561-1_20openalex-snapshot
Approximate Solutions and α-Well-Posedness for Variational Inequalities and Nash Equilibria
inferred← citeshttps://doi.org/10.1007/978-1-4899-0289-4_20openalex-snapshot
Mathematical Programming in Machine Learning
inferred← citeshttps://doi.org/10.1007/978-1-4899-1358-6_14openalex-snapshot
Advantages and Drawbacks of Variational Inequalities Formulations
inferred← citeshttps://doi.org/10.1007/978-3-319-18161-5_11openalex-snapshot
A DC Algorithm for Solving Quadratic-linear Bilevel Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-87477-5_38openalex-snapshot
DC Programming Approach for a Class of Nonconvex Programs Involving l 0 Norm
inferred← citeshttps://doi.org/10.1007/978-3-642-99789-1_13openalex-snapshot
Machine Learning via Polyhedral Concave Minimization
inferred← citeshttps://doi.org/10.1007/bf02124738openalex-snapshot
Hybrid misclassification minimization
inferred← citeshttps://doi.org/10.1007/bf02592103openalex-snapshot
Complementarity formulations and existence of solutions of dynamic multi-rigid-body contact problems with coulomb friction
inferred← citeshttps://doi.org/10.1007/bf02614322openalex-snapshot
Error bounds in mathematical programming
inferred← citeshttps://doi.org/10.1007/bf03182744openalex-snapshot
A trust region algorithm for bilevel programing problems
inferred← citeshttps://doi.org/10.1007/s00186-006-0076-2openalex-snapshot
Global Convergence of a Smooth Approximation Method for Mathematical Programs with Complementarity Constraints
inferred← citeshttps://doi.org/10.1007/s10107-004-0539-2openalex-snapshot
Optimization problems with equilibrium constraints and their numerical solution
inferred← citeshttps://doi.org/10.1007/s10107-012-0569-0openalex-snapshot
Smoothing methods for nonsmooth, nonconvex minimization
inferred← citeshttps://doi.org/10.1007/s10107-022-01794-8openalex-snapshot
An exact penalty approach for optimization with nonnegative orthogonality constraints
inferred← citeshttps://doi.org/10.1007/s10107990015aopenalex-snapshot
A smoothing method for mathematical programs with equilibrium constraints
inferred← citeshttps://doi.org/10.1007/s10287-009-0099-2openalex-snapshot
DC programming and DCA for globally solving the value-at-risk
inferred← citeshttps://doi.org/10.1007/s10479-004-5024-zopenalex-snapshot
A Modified Relaxation Scheme for Mathematical Programs with Complementarity Constraints
inferred← citeshttps://doi.org/10.1007/s10479-005-2450-5openalex-snapshot
A Simplex Approach for Finding Local Solutions of a Linear Bilevel Program by Equilibrium Points
inferred← citeshttps://doi.org/10.1007/s10483-007-1013-zopenalex-snapshot
A new smoothing technique for mathematical programs with equilibrium constraints
inferred← citeshttps://doi.org/10.1007/s10589-005-3075-yopenalex-snapshot
A Robust SQP Method for Mathematical Programs with Linear Complementarity Constraints
inferred← citeshttps://doi.org/10.1007/s10589-005-3230-5openalex-snapshot
A Superlinearly Convergent Implicit Smooth SQP Algorithm for Mathematical Programs with Nonlinear Complementarity Constraints
inferred← citeshttps://doi.org/10.1007/s10589-022-00433-4openalex-snapshot
A two-level distributed algorithm for nonconvex constrained optimization
inferred← citeshttps://doi.org/10.1007/s10589-023-00476-1openalex-snapshot
Convergence rate estimates for penalty methods revisited
inferred← citeshttps://doi.org/10.1007/s10898-008-9325-7openalex-snapshot
DC programming techniques for solving a class of nonlinear bilevel programs
inferred← citeshttps://doi.org/10.1007/s10898-010-9644-3openalex-snapshot
On linear programs with linear complementarity constraints
inferred← citeshttps://doi.org/10.1007/s10898-011-9765-3openalex-snapshot
Exact penalty and error bounds in DC programming
inferred← citeshttps://doi.org/10.1007/s10957-004-0946-9openalex-snapshot
Global Optimization Method for Solving Mathematical Programs with Linear Complementarity Constraints
inferred← citeshttps://doi.org/10.1007/s10957-004-1711-9openalex-snapshot
A Study of Local Solutions in Linear Bilevel Programming
inferred← citeshttps://doi.org/10.1007/s10957-011-9958-4openalex-snapshot
Levitin–Polyak Well-Posedness for Optimization Problems with Generalized Equilibrium Constraints
inferred← citeshttps://doi.org/10.1007/s10957-012-0227-yopenalex-snapshot
A Relaxed Constant Positive Linear Dependence Constraint Qualification for Mathematical Programs with Equilibrium Constraints
inferred← citeshttps://doi.org/10.1007/s10957-016-0967-1openalex-snapshot
Error Bounds Via Exact Penalization with Applications to Concave and Quadratic Systems
inferred← citeshttps://doi.org/10.1007/s10957-019-01561-4openalex-snapshot
Two New Weak Constraint Qualifications for Mathematical Programs with Equilibrium Constraints and Applications
inferred← citeshttps://doi.org/10.1007/s11228-020-00569-7openalex-snapshot
Sufficient Conditions for Metric Subregularity of Constraint Systems with Applications to Disjunctive and Ortho-Disjunctive Programs
inferred← citeshttps://doi.org/10.1007/s11432-024-4229-1openalex-snapshot
Cross-subcarrier precoder design for massive MIMO-OFDM downlink with symplectic optimization
inferred← citeshttps://doi.org/10.1007/s11859-010-0686-7openalex-snapshot
Exact penalty method for the nonlinear bilevel programming problem
inferred← citeshttps://doi.org/10.1007/s12597-024-00820-xopenalex-snapshot
E-optimality and E-duality results for fractional semi-infinite optimization problems having equilibrium constraints
inferred← citeshttps://doi.org/10.1007/s41980-018-0170-2openalex-snapshot
$$l_{p}$$ l p -Norm Regularization Method $$ (0<p<1) $$ ( 0 < p < 1 ) and DC Programming for Correction System of Inconsistency Linear Inequalities
inferred← citeshttps://doi.org/10.1016/j.amc.2004.03.005openalex-snapshot
Global Lipschitzian error bounds for semidefinite complementarity problems with emphasis on NCPs
inferred← citeshttps://doi.org/10.1016/j.amc.2005.01.141openalex-snapshot
A superlinearly convergent SQP algorithm for mathematical programs with linear complementarity constraints
inferred← citeshttps://doi.org/10.1016/j.amc.2011.03.011openalex-snapshot
Active set algorithm for mathematical programs with linear complementarity constraints
inferred← citeshttps://doi.org/10.1016/j.camwa.2007.03.019openalex-snapshot
Well-posedness for equilibrium problems and for optimization problems with equilibrium constraints
inferred← citeshttps://doi.org/10.1016/j.ejor.2017.02.020openalex-snapshot
Optimization approaches to Supervised Classification
inferred← citeshttps://doi.org/10.1016/j.fmre.2023.04.006openalex-snapshot
The exactness of the ℓ1 penalty function for a class of mathematical programs with generalized complementarity constraints
inferred← citeshttps://doi.org/10.1016/j.jmaa.2004.10.032openalex-snapshot
Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
inferred← citeshttps://doi.org/10.1016/j.na.2010.04.066openalex-snapshot
Exact penalty functions and calmness for mathematical programming under nonlinear perturbations
inferred← citeshttps://doi.org/10.1016/j.trb.2012.05.003openalex-snapshot
A global optimization method for continuous network design problems
inferred← citeshttps://doi.org/10.1016/s0045-7825(98)00280-1openalex-snapshot
On the solution of a minimum weight elastoplastic problem involving displacement and complementarity constraints
inferred← citeshttps://doi.org/10.1023/a:1008370910807openalex-snapshot
Well-posedness for Optimization Problems with Constraints defined by Variational Inequalities having a unique solution
inferred← citeshttps://doi.org/10.1023/a:1008656806889openalex-snapshot
Complementarity Constraint Qualifications and Simplified B-Stationarity Conditions for Mathematical Programs with Equilibrium Constraints
inferred← citeshttps://doi.org/10.1023/a:1008696504163openalex-snapshot
QPECgen, a MATLAB Generator for Mathematical Programs with Quadratic Objectives and Affine Variational Inequality Constraints
inferred← citeshttps://doi.org/10.1023/a:1018359900133openalex-snapshot
A Globally Convergent Sequential Quadratic Programming Algorithm for Mathematical Programs with Linear Complementarity Constraints
inferred← citeshttps://doi.org/10.1023/a:1022945316191openalex-snapshot
Extension of Quasi-Newton Methods to Mathematical Programs with Complementarity Constraints
inferred← citeshttps://doi.org/10.1023/a:1024739508603openalex-snapshot
New Relaxation Method for Mathematical Programs with Complementarity Constraints
inferred← citeshttps://doi.org/10.1051/cocv/2021022openalex-snapshot
Coupled versus decoupled penalization of control complementarity constraints
inferred← citeshttps://doi.org/10.1080/01630560600657323openalex-snapshot
Convergence of an Inexact Smoothing Method for Mathematical Programs with Equilibrium Constraints
inferred← citeshttps://doi.org/10.1080/01630563.2015.1078813openalex-snapshot
On Efficiency Conditions for Nonsmooth Vector Equilibrium Problems with Equilibrium Constraints
inferred← citeshttps://doi.org/10.1080/0233193031000120020openalex-snapshot
A Fritz John Approach to First Order Optimality Conditions for Mathematical Programs with Equilibrium Constraints
inferred← citeshttps://doi.org/10.1080/0233193031000149894openalex-snapshot
Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
inferred← citeshttps://doi.org/10.1080/02331934.2014.987776openalex-snapshot
Optimality conditions for nonsmooth mathematical programs with equilibrium constraints, using convexificators
inferred← citeshttps://doi.org/10.1080/02331934.2015.1122005openalex-snapshot
A unifying theory of exactness of linear penalty functions
inferred← citeshttps://doi.org/10.1080/02331934.2022.2038151openalex-snapshot
Mordukhovich stationarity for mathematical programs with switching constraints under weak constraint qualifications
inferred← citeshttps://doi.org/10.1080/10556780410001654241openalex-snapshot
Solving mathematical programs with complementarity constraints as nonlinear programs
inferred← citeshttps://doi.org/10.1080/10556788.2025.2567426openalex-snapshot
Indirect methods for optimal control of parabolic hybrid PDE-dynamical/switching systems using relaxation
inferred← citeshttps://doi.org/10.1109/70.406939openalex-snapshot
First-order stability cells of active multi-rigid-body systems
inferred← citeshttps://doi.org/10.1109/cis.workshops.2007.47openalex-snapshot
A Dynamic Pricing Model for Postponement Supply Chain: The Bi-level Programming Approach
inferred← citeshttps://doi.org/10.1109/icks.2004.1313426openalex-snapshot
Smoothing methods for mathematical programs with equilibrium constraints
inferred← citeshttps://doi.org/10.1109/icks.2004.32openalex-snapshot
Smoothing methods for mathematical programs with equilibrium constraints
inferred← citeshttps://doi.org/10.1109/tpwrs.2021.3073116openalex-snapshot
A Two-Level ADMM Algorithm for AC OPF With Global Convergence Guarantees
inferred← citeshttps://doi.org/10.1134/s0965542515040090openalex-snapshot
Tikhonov regularization for mathematical programs with generalized complementarity constraints
inferred← citeshttps://doi.org/10.1137/090748883openalex-snapshot
A New Relaxation Scheme for Mathematical Programs with Equilibrium Constraints
inferred← citeshttps://doi.org/10.1137/090771016openalex-snapshot
Optimality Conditions via Exact Penalty Functions
inferred← citeshttps://doi.org/10.1137/090774975openalex-snapshot
Mathematical Programs with Equilibrium Constraints: Enhanced Fritz John-conditions, New Constraint Qualifications, and Improved Exact Penalty Results
inferred← citeshttps://doi.org/10.1137/24m1687662openalex-snapshot
On Stability in Optimistic Bilevel Optimization
inferred← citeshttps://doi.org/10.1137/24m1692782openalex-snapshot
Projected Gradient Descent Accumulates at Bouligand Stationary Points
inferred← citeshttps://doi.org/10.1137/s0363012994261690openalex-snapshot
Nondegenerate Solutions and Related Concepts in Affine Variational Inequalities
inferred← citeshttps://doi.org/10.1137/s0363012996306121openalex-snapshot
Exact Penalization of Mathematical Programs with Equilibrium Constraints
inferred← citeshttps://doi.org/10.1137/s1052623493257344openalex-snapshot
Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
inferred← citeshttps://doi.org/10.1137/s1052623497332329openalex-snapshot
Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
inferred← citeshttps://doi.org/10.1137/s105262349833338xopenalex-snapshot
Expressing Complementarity Problems in an Algebraic Modeling Language and Communicating Them to Solvers
inferred← citeshttps://doi.org/10.1137/s1052623499365292openalex-snapshot
Complementarity Constraint Qualification via the Theory of 2-Regularity
inferred← citeshttps://doi.org/10.1142/s0217595922500439openalex-snapshot
Wolfe-Type Duality for Mathematical Programs with Switching Constraints
inferred← citeshttps://doi.org/10.1155/2014/630547openalex-snapshot
Exact Penalization and Necessary Optimality Conditions for Multiobjective Optimization Problems with Equilibrium Constraints
inferred← citeshttps://doi.org/10.1155/2015/385713openalex-snapshot
Global Optimization for Transport Network Expansion and Signal Setting
inferred← citeshttps://doi.org/10.11650/twjm/1500404864openalex-snapshot
WELL-POSEDNESS FOR VECTOR VARIATIONAL INEQUALITY AND CONSTRAINED VECTOR OPTIMIZATION
inferred← citeshttps://doi.org/10.12677/aam.2024.136271openalex-snapshot
Objective Penalty Function Method for Mathematical Program with Switching Constraints
inferred← citeshttps://doi.org/10.1287/ijoc.10.2.209openalex-snapshot
Feature Selection via Mathematical Programming
inferred← citeshttps://doi.org/10.1287/moor.22.4.977openalex-snapshot
Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
inferred← citeshttps://doi.org/10.1287/moor.24.3.627openalex-snapshot
Optimality Conditions for a Class of Mathematical Programs with Equilibrium Constraints
inferred← citeshttps://doi.org/10.1360/02ys0282openalex-snapshot
Continuity for vector optimization problems with equilibrium constraints
inferred← citeshttps://doi.org/10.14736/kyb-2016-2-0169openalex-snapshot
An SQP method for mathematical programs with complementarity constraints with strong convergence properties
inferred← citeshttps://doi.org/10.18452/16230openalex-snapshot
Modelling and optimisation of the design and topology of flexible frames with rigid joints
inferred← citeshttps://doi.org/10.32657/10356/67035openalex-snapshot
Global optimization methods for urban road network design problems
inferred← citeshttps://doi.org/10.4208/nmtma.2010.33.6openalex-snapshot
Superlinear Convergence of a Smooth Approximation Method for Mathematical Programs with Nonlinear Complementarity Constraints
inferred← citeshttps://doi.org/10.5269/bspm.81486openalex-snapshot
Optimality and Duality for Semi-Infinite Mathematical Programs with Equilibrium Constraints via Tangential Subdifferentials
inferred← citeshttps://doi.org/10.5555/2781851.2781852openalex-snapshot
Mathematical Programs with Complementarity Constraints
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.