A comparison of solution approaches for the numerical treatment of or-constrained optimization problems
From MaRDI portal
Publication:1986109
Abstract: Mathematical programs with or-constraints form a new class of disjunctive optimization problems with inherent practical relevance. In this paper, we provide a comparison of three different first-order methods for the numerical treatment of this problem class which are inspired by classical approaches from disjunctive programming. First, we study the replacement of the or-constraints as nonlinear inequality constraints using suitable NCP-functions. Second, we transfer the or-constrained program into a mathematical program with switching or complementarity constraints which can be treated with the aid of well-known relaxation methods. Third, a direct Scholtes-type relaxation of the or-constraints is investigated. A numerical comparison of all these approaches which is based on three essentially different model programs from or-constrained optimization closes the paper.
Recommendations
- scientific article; zbMATH DE number 3963580
- A comparative study on optimization methods for the constrained nonlinear programming problems
- On the numerical solution of bound constrained optimization problems
- A numerical approach to optimization problems with variational inequality constraints
- Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
- A hybrid method for solving general constrained optimization problems
- A hybrid approach to constrained optimization problems
- scientific article; zbMATH DE number 1568995
- scientific article; zbMATH DE number 4156221
Cites work
- A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
- A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
- A new regularization method for mathematical programs with complementarity constraints with strong convergence properties
- A New Relaxation Scheme for Mathematical Programs with Equilibrium Constraints
- A semismooth equation approach to the solution of nonlinear complementarity problems
- A smoothing method for mathematical programs with equilibrium constraints
- A special newton-type optimization method
- A theoretical and numerical comparison of some semismooth algorithms for complementarity problems
- Abadie-type constraint qualification for mathematical programs with equilibrium constraints
- Benchmarking optimization software with performance profiles.
- Complementarity constraints as nonlinear equations: Theory and numerical experience
- Convergence properties of a regularization scheme for mathematical programs with complementarity constraints
- Disjunctive programming
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- scientific article; zbMATH DE number 417962 (Why is no real title available?)
- Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
- Logic, optimization, and constraint programming
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
- New NCP-functions and their properties
- New verifiable stationarity concepts for a class of mathematical programs with disjunctive constraints
- Nonconvex penalization of switching control of partial differential equations
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- On NCP-functions
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- On the linear independence constraint qualification in disjunctive programming
- Optimal control
- Optimal control of partial differential equations. Theory, methods and applications
- Optimal control problems with control complementarity constraints: existence results, optimality conditions, and a penalty method
- Optimality conditions for disjunctive programs based on generalized differentiation with application to mathematical programs with equilibrium constraints
- Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints
- Optimization and nonsmooth analysis
- Properties and construction of NCP functions
- Relaxation schemes for mathematical programmes with switching constraints
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Some Noninterior Continuation Methods for Linear Complementarity Problems
- Stationarity conditions and constraint qualifications for mathematical programs with switching constraints. With applications to either-or-constrained programming
- Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
- Variational Analysis
Cited in
(5)- Orbital Shrinking: A New Tool for Hybrid MIP/CP Methods
- 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
- Revisiting implicit variables in mathematical optimization: simplified modeling and a numerical evidence
This page was built for publication: A comparison of solution approaches for the numerical treatment of or-constrained optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1986109)
