Convergence of a continuous approach for zero-one programming problems
From MaRDI portal
Publication:621018
DOI10.1016/j.amc.2010.11.022zbMath1209.65059MaRDI QIDQ621018
Tao Tan, Xing-Si Li, Yan-Yan Li
Publication date: 2 February 2011
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2010.11.022
convergence; optimality condition; augmented Lagrangian method; Fischer-Burmeister function; Boolean variables; nonlinear programming program; zero-one programming problems
65K05: Numerical mathematical programming methods
90C30: Nonlinear programming
90C09: Boolean programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New results on the equivalence between zero-one programming and continuous concave programming
- Enlarging the region of convergence of Newton's method for constrained optimization
- A smoothing method for mathematical programs with equilibrium constraints
- Solution of monotone complementarity problems with locally Lipschitzian functions
- 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
- A special newton-type optimization method
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints