On a relaxation method for mathematical programs with vanishing constraints
From MaRDI portal
Numerical methods of relaxation type (49M20) Numerical optimization and variational techniques (65K10) Sensitivity, stability, parametric optimization (90C31) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Applications of mathematical programming (90C90)
Recommendations
- Mathematical programs with vanishing constraints: Optimality conditions, sensitivity, and a relaxation method
- Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
- Mathematical programs with vanishing constraints: constraint qualifications, their applications, and a new regularization method
- A smoothing-regularization approach to mathematical programs with vanishing constraints
- A study of one-parameter regularization methods for mathematical programs with vanishing constraints
Cites work
- A parametric active-set method for qps with vanishing constraints arising in a robot motion planning problem
- A smoothing-regularization approach to mathematical programs with vanishing constraints
- Convergence of a local regularization approach for mathematical programmes with complementarity or vanishing constraints
- Convergence properties of a regularization scheme for mathematical programs with complementarity constraints
- Exact penalty results for mathematical programs with vanishing constraints
- First- and second-order optimality conditions for mathematical programs with vanishing constraints.
- Mathematical programs with vanishing constraints: critical point theory
- Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
- Mathematical programs with vanishing constraints: Optimality conditions, sensitivity, and a relaxation method
- On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Optimality conditions and Newton-type methods for mathematical programs with vanishing constraints
- Optimization with variable sets of constraints and an application to truss design
- Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
- Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
- Strongly Regular Generalized Equations
Cited in
(21)- Mathematical programs with vanishing constraints: Optimality conditions, sensitivity, and a relaxation method
- Notes on convergence properties for a smoothing-regularization approach to mathematical programs with vanishing constraints
- Active-set Newton methods for mathematical programs with vanishing constraints
- An SQP method for mathematical programs with vanishing constraints with strong convergence properties
- Mathematical programs with blocks of vanishing constraints arising in discretized mixed-integer optimal control problems
- New dualities for mathematical programs with vanishing constraints
- Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation
- A smoothing-regularization approach to mathematical programs with vanishing constraints
- Convergence of a local regularization approach for mathematical programmes with complementarity or vanishing constraints
- A semismooth sequential quadratic programming method for lifted mathematical programs with vanishing constraints
- Mathematical programs with vanishing constraints: critical point theory
- Mathematical programs with vanishing constraints: constraint qualifications, their applications, and a new regularization method
- A study of one-parameter regularization methods for mathematical programs with vanishing constraints
- On the linear independence constraint qualification in disjunctive programming
- On an \(l_1\) exact penalty result for mathematical programs with vanishing constraints
- Modified relaxation method for mathematical programs with complementarity constraints
- A two-sided relaxation scheme for Mathematical Programs with Equilibrium Constraints
- Relaxation schemes for mathematical programmes with switching constraints
- Extended McCormick relaxation rules for handling empty arguments representing infeasibility
- Lagrangian-based neural network solution method for mathematical programs with vanishing constraints and its application in truss topology
- A relaxation approach to vector-valued Allen-Cahn MPEC problems
This page was built for publication: On a relaxation method for mathematical programs with vanishing constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4900439)
