A smoothing method for zero--one constrained extremum problems

DOI10.1007/S10957-011-9828-0MaRDI QIDQ637567zbMATH OpenOpenAlexFDO

Authors Tao Tan, Yanyan Li, Xingsi 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

zbMATH Keywords

augmented Lagrangian methodmathematical programs with complementarity constraintszero-one constrained extremum problems

Mathematics Subject Classification ID

Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Boolean programming (90C09)

Recommendations

• Convergence of a continuous approach for zero-one programming problems
• Unconstrained 0-1 nonlinear programming: A nondifferentiable approach
• Smoothing method for minimax problems
• Analysis of penalty parameters in binary constrained extremum problems
• scientific article; zbMATH DE number 822150

Cites work

• scientific article; zbMATH DE number 3534294 (Why is no real title available?)
• scientific article; zbMATH DE number 1552025 (Why is no real title available?)
• scientific article; zbMATH DE number 1424524 (Why is no real title available?)
• A Smooth Variational Principle With Applications to Subdifferentiability and to Differentiability of Convex Functions
• A global continuation algorithm for solving binary quadratic programming problems
• A special newton-type optimization method
• An Aggregate Constraint Method for Non-Linear Programming
• An efficient approach to a class of non-smooth optimization problems
• An exact penalty approach for solving a class of minimization problems with boolean variables
• Complementarity constraint qualifications and simplified \(B\)-stationary conditions for mathematical programs with equilibrium constraints
• Equivalence of Complementarity Problems to Differentiable Minimization: A Unified Approach
• Equivalence of the Complementarity Problem to a System of Nonlinear Equations
• Global minimization using an augmented Lagrangian method with variable lower-level constraints
• Lower-order penalty methods for mathematical programs with complementarity constraints
• Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
• Numerical Optimization
• On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
• On the continuity of the minimum set of a continuous function
• On the convergence of general regularization and smoothing schemes for mathematical programs with complementarity constraints
• On the entropic regularization method for solving min-max problems with applications
• Penalty for zero–one integer equivalent problem
• Solution of monotone complementarity problems with locally Lipschitzian functions

Cited in

(2)

• Convergence of a continuous approach for zero-one programming problems
• Zero duality gap in surrogate constraint optimization: a concise review of models

This page was built for publication: A smoothing method for zero--one constrained extremum problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q637567)