A study of one-parameter regularization methods for mathematical programs with vanishing constraints
DOI10.1080/10556788.2020.1797025OpenAlexW3046053936MaRDI QIDQ5038431
Aram Pooladian, Blanca Pablos, Alexandra Schwartz, Luke Steverango, Tim Hoheisel
Publication date: 30 September 2022
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.15662
optimality conditionsregularization methodconstraint qualificationaerothermodynamicstruss topology optimizationT-stationarityM-stationaritymathematical program with vanishing constraints
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Existence theories for optimal control problems involving ordinary differential equations (49J15) Numerical methods of relaxation type (49M20)
Cites Work
- Mathematical programs with vanishing constraints: critical point theory
- Exact penalty results for mathematical programs with vanishing constraints
- Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
- First- and second-order optimality conditions for mathematical programs with vanishing constraints.
- Mathematical programs with vanishing constraints: Optimality conditions, sensitivity, and a relaxation method
- Foundations of optimization
- On the relation between constant positive linear dependence condition and quasinormality constraint qualification
- Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
- An SQP method for mathematical programs with vanishing constraints with strong convergence properties
- Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
- A smoothing-regularization approach to mathematical programs with vanishing constraints
- Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints
- Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
- A New Regularization Method for Mathematical Programs with Complementarity Constraints with Strong Convergence Properties
- Convergence of a local regularization approach for mathematical programmes with complementarity or vanishing constraints
- Mathematical programs with vanishing constraints: a new regularization approach with strong convergence properties
- Optimality conditions and newton-type methods for mathematical programs with vanishing constraints
- A New Relaxation Scheme for Mathematical Programs with Equilibrium Constraints
- Instationary Heat-Constrained Trajectory Optimization of a Hypersonic Space Vehicle by ODE–PDE-Constrained Optimal Control
- On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
- On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
- Mathematical programs with vanishing constraints: constraint qualifications, their applications, and a new regularization method
- On a relaxation method for mathematical programs with vanishing constraints
- A New Regularization Scheme for Mathematical Programs with Complementarity Constraints
- The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited
- On Perspective Functions and Vanishing Constraints in Mixed-Integer Nonlinear Optimal Control
