A comparison of solution approaches for the numerical treatment of or-constrained optimization problems
From MaRDI portal
Publication:1986109
DOI10.1007/s10589-020-00169-zzbMath1461.65175arXiv1905.01893OpenAlexW3005436065MaRDI QIDQ1986109
Publication date: 7 April 2020
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.01893
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Asymptotic regularity for Lipschitzian nonlinear optimization problems with applications to complementarity constrained and bilevel programming ⋮ An augmented Lagrangian method for optimization problems with structured geometric constraints ⋮ Constrained composite optimization and augmented Lagrangian methods
Uses Software
Cites Work
- Unnamed Item
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
- Properties and construction of NCP functions
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- On NCP-functions
- A smoothing method for mathematical programs with equilibrium constraints
- A semismooth equation approach to the solution of nonlinear complementarity problems
- New NCP-functions and their properties
- A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- A theoretical and numerical comparison of some semismooth algorithms for complementarity problems
- Nonconvex penalization of switching control of partial differential equations
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
- Stationarity conditions and constraint qualifications for mathematical programs with switching constraints. With applications to either-or-constrained programming
- Abadie-type constraint qualification for mathematical programs with equilibrium constraints
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints
- Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints
- A New Regularization Method for Mathematical Programs with Complementarity Constraints with Strong Convergence Properties
- Logic, Optimization, and Constraint Programming
- A New Relaxation Scheme for Mathematical Programs with Equilibrium Constraints
- A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
- Optimality Conditions for Disjunctive Programs Based on Generalized Differentiation with Application to Mathematical Programs with Equilibrium Constraints
- Complementarity constraints as nonlinear equations: Theory and numerical experience
- Optimization and nonsmooth analysis
- A special newton-type optimization method
- Variational Analysis
- New verifiable stationarity concepts for a class of mathematical programs with disjunctive constraints
- Disjunctive Programming
- Some Noninterior Continuation Methods for Linear Complementarity Problems
- Optimal control problems with control complementarity constraints: existence results, optimality conditions, and a penalty method
- On the linear independence constraint qualification in disjunctive programming
- Optimale Steuerung partieller Differentialgleichungen
- Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
- Relaxation schemes for mathematical programmes with switching constraints
- Optimal control
- Benchmarking optimization software with performance profiles.
