A smoothing method for zero--one constrained extremum problems
DOI10.1007/s10957-011-9828-0zbMath1229.90092OpenAlexW2056061551MaRDI QIDQ637567
Tao Tan, Xing-Si Li, Yan-Yan Li
Publication date: 6 September 2011
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-011-9828-0
augmented Lagrangian methodmathematical programs with complementarity constraintszero-one constrained extremum problems
Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Boolean programming (90C09)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A global continuation algorithm for solving binary quadratic programming problems
- Complementarity constraint qualifications and simplified \(B\)-stationary conditions for mathematical programs with equilibrium constraints
- An efficient approach to a class of non-smooth optimization problems
- Solution of monotone complementarity problems with locally Lipschitzian functions
- On the entropic regularization method for solving min-max problems with applications
- Global minimization using an augmented Lagrangian method with variable lower-level constraints
- On the continuity of the minimum set of a continuous function
- Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
- Penalty for zero–one integer equivalent problem
- A Smooth Variational Principle With Applications to Subdifferentiability and to Differentiability of Convex Functions
- An exact penalty approach for solving a class of minimization problems with boolean variables
- An Aggregate Constraint Method for Non-Linear Programming
- Equivalence of the Complementarity Problem to a System of Nonlinear Equations
- Numerical Optimization
- A special newton-type optimization method
- On the convergence of general regularization and smoothing schemes for mathematical programs with complementarity constraints
- Equivalence of Complementarity Problems to Differentiable Minimization: A Unified Approach
- Lower-order penalty methods for mathematical programs with complementarity constraints
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
This page was built for publication: A smoothing method for zero--one constrained extremum problems
