Convergence of a continuous approach for zero-one programming problems

DOI10.1016/j.amc.2010.11.022zbMath1209.65059OpenAlexW2054386599MaRDI 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

zbMATH Keywords

convergenceoptimality conditionaugmented Lagrangian methodFischer-Burmeister functionBoolean variablesnonlinear programming programzero-one programming problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Boolean programming (90C09)

Related Items (1)

Adaptive multi-channel contrastive graph convolutional network with graph and feature fusion

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

This page was built for publication: Convergence of a continuous approach for zero-one programming problems