Revisiting implicit variables in mathematical optimization: simplified modeling and a numerical evidence
From MaRDI portal
Cites work
- A comparison of solution approaches for the numerical treatment of or-constrained optimization problems
- A fresh look at nonsmooth Levenberg–Marquardt methods with applications to bilevel optimization
- A new augmented Lagrangian method for MPCCs -- theoretical and numerical comparison with existing augmented Lagrangian methods
- A Sequential Smooth Penalization Approach to Mathematical Programs with Complementarity Constraints
- A study of one-parameter regularization methods for mathematical programs with vanishing constraints
- An Active-Set Newton Method for Mathematical Programs with Complementarity Constraints
- An augmented Lagrangian method for cardinality-constrained optimization problems
- An augmented Lagrangian method for optimization problems with structured geometric constraints
- Bilevel programming problems. Theory, algorithms and applications to energy networks
- Calmness and calculus: two basic patterns
- Complementarity active-set algorithm for mathematical programming problems with equilibrium constraints
- Constraint qualifications and optimality conditions for optimization problems with cardinality constraints
- Duality-based single-level reformulations of bilevel optimization problems
- First- and second-order optimality conditions for mathematical programs with vanishing constraints.
- Foundations of bilevel programming
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- Interior Methods for Mathematical Programs with Complementarity Constraints
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
- Mathematical programs with cardinality constraints: reformulation by complementarity-type conditions and a regularization method
- Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
- MPEC methods for bilevel optimization problems
- Necessary and sufficient conditions for M-stationarity of nonsmooth optimization problems with vanishing constraints
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
- New constraint qualifications for mathematical programs with equilibrium constraints via variational analysis
- Normally admissible stratifications and calculation of normal cones to a finite union of polyhedral sets
- On computation of generalized derivatives of the normal-cone mapping and their applications
- On computation of limiting coderivatives of the normal-cone mapping to inequality systems and their applications
- On implicit variables in optimization theory
- On inner calmness\(^\ast\), generalized calculus, and derivatives of the normal cone mapping
- On LICQ and the uniqueness of Lagrange multipliers
- On M-stationarity conditions in MPECs and the associated qualification conditions
- On the Aubin property of solution maps to parameterized variational systems with implicit constraints
- On the Karush-Kuhn-Tucker reformulation of the bilevel optimization problem
- On the linear independence constraint qualification in disjunctive programming
- Optimality conditions for bilevel programming problems
- Optimality conditions for sparse nonlinear programming
- Practical augmented Lagrangian methods for constrained optimization
- Practical bilevel optimization. Algorithms and applications
- Reformulation of the M-stationarity conditions as a system of discontinuous equations and its solution by a semismooth Newton method
- Relaxation schemes for mathematical programmes with switching constraints
- Robinson Stability of Parametric Constraint Systems via Variational Analysis
- SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
- Second-order optimality conditions and improved convergence results for regularization methods for cardinality-constrained optimization problems
- Semivectorial bilevel programming versus scalar bilevel programming
- Set regularities and feasibility problems
- Stability analysis for parameterized variational systems with implicit constraints
- Subdifferentials of optimal value functions under metric qualification conditions
- Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
- Theoretical and numerical comparison of the Karush-Kuhn-Tucker and value function reformulations in bilevel optimization
- Variational Analysis
- Variational analysis and applications
This page was built for publication: Revisiting implicit variables in mathematical optimization: simplified modeling and a numerical evidence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7307982)
