A smoothing method for zero--one constrained extremum problems
The zero-one constrained extremum problem has received a lot of attention due to its difficulty and its numerous practical applications in production planning, telecommunications, cluster analysis, etc. In this paper, the authors consider the zero-one constrained extremum problem that they reformulate as a continuous optimization problem by transforming it into a mathematical program with complementarity constraints and then into an ordinary nonlinear programming problem with the help of the Fischer-Burmeister function. The method proposed within the paper has the main advantage that obtains an equivalent differentiable ordinary nonlinear programming problem due to the strict complementary condition. In addition the aggregate function method is used in order to simplify the computations during which the whole original constraints are reformulated and approximated by only one single smoothing equality constraint with the accuracy of the approximation controlled by one parameter. In this way the approach proposed by the authors is easily programmable and practical.
- A global continuation algorithm for solving binary quadratic programming problems
- A Smooth Variational Principle With Applications to Subdifferentiability and to Differentiability of Convex Functions
- 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
- 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?)
- 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
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)
