A study of one-parameter regularization methods for mathematical programs with vanishing constraints

DOI10.1080/10556788.2020.1797025MaRDI QIDQ5038431zbMATH OpenOpenAlexFDO

Authors Blanca Pablos, Aram Pooladian, Alexandra Schwartz, Luke Steverango, T. Hoheisel

Publication date 30 September 2022

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2006.15662

zbMATH Keywords

aerothermodynamicsconstraint qualificationM-stationaritymathematical program with vanishing constraintsoptimality conditionsregularization methodT-stationaritytruss topology optimization

Mathematics Subject Classification ID

Existence theories for optimal control problems involving ordinary differential equations (49J15) Numerical methods of relaxation type (49M20) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31)

Recommendations

• Mathematical programs with vanishing constraints: a new regularization approach with strong convergence properties
• Convergence of a local regularization approach for mathematical programmes with complementarity or vanishing constraints
• scientific article; zbMATH DE number 7366730
• A smoothing-regularization approach to mathematical programs with vanishing constraints
• Mathematical programs with vanishing constraints: constraint qualifications, their applications, and a new regularization method

Cites work

• A new regularization method for mathematical programs with complementarity constraints with strong convergence properties
• A new regularization scheme for mathematical programs with complementarity constraints
• A New Relaxation Scheme for Mathematical Programs with Equilibrium Constraints
• A smoothing-regularization approach to mathematical programs with vanishing constraints
• An SQP method for mathematical programs with vanishing constraints with strong convergence properties
• 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.
• Foundations of optimization
• Instationary heat-constrained trajectory optimization of a hypersonic space vehicle by ODE-PDE-constrained optimal control
• Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
• Mathematical programs with vanishing constraints: a new regularization approach with strong convergence properties
• Mathematical programs with vanishing constraints: constraint qualifications, their applications, and a new regularization method
• 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 a relaxation method for mathematical programs with vanishing constraints
• On perspective functions and vanishing constraints in mixed-integer nonlinear 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
• On the relation between constant positive linear dependence condition and quasinormality constraint qualification
• Optimality conditions and Newton-type methods for mathematical programs with vanishing constraints
• Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
• The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited
• Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints

Cited in

(11)

• A smoothing-regularization approach to mathematical programs with vanishing constraints
• A study of the one dimensional total generalised variation regularisation problem
• 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
• On a relaxation method for mathematical programs with vanishing constraints
• A parametric active-set method for qps with vanishing constraints arising in a robot motion planning problem
• A Study of One-Parameter Regularization Methods for Mathematical Programs with Vanishing Constraints
• Constraint qualifications and optimality conditions for nonsmooth multiobjective mathematical programming problems with vanishing constraints on Hadamard manifolds via convexificators
• Approximate stationarity in disjunctive optimization: concepts, qualification conditions, and application to MPCCs
• Lagrangian-based neural network solution method for mathematical programs with vanishing constraints and its application in truss topology
• Revisiting implicit variables in mathematical optimization: simplified modeling and a numerical evidence

This page was built for publication: A study of one-parameter regularization methods 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 Q5038431)