Exact penalty functions for nonlinear integer programming problems
From MaRDI portal
Publication:983724
DOI10.1007/s10957-010-9700-7zbMath1206.90100OpenAlexW2094034289MaRDI QIDQ983724
Stefano Lucidi, Francesco Rinaldi
Publication date: 24 July 2010
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.725.4020
Related Items
An exact minimax penalty function method and saddle point criteria for nonsmooth convex vector optimization problems, Continuous quadratic programming formulations of optimization problems on graphs, Improved penalty algorithm for mixed integer PDE constrained optimization problems, A Computational Framework for Solving Nonlinear Binary Optimization Problems in Robust Causal Inference, A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems, An exact penalty function method for nonlinear mixed discrete programming problems, An exact penalty global optimization approach for mixed-integer programming problems, Continuous reformulations for zero-one programming problems, Evolution differential inclusion with projection for solving constrained nonsmooth convex optimization in Hilbert space, Feasibility Pump-like heuristics for mixed integer problems, On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems, An exact \(l_1\) exponential penalty function method for multiobjective optimization problems with exponential-type invexity, Optimality conditions for mixed discrete bilevel optimization problems, Exact penalty functions for nonlinear integer programming problems, Firefly penalty-based algorithm for bound constrained mixed-integer nonlinear programming, An improved penalty algorithm using model order reduction for MIPDECO problems with partial observations
Cites Work
- Unnamed Item
- Unnamed Item
- An algorithm for nonlinear optimization problems with binary variables
- New results on the equivalence between zero-one programming and continuous concave programming
- Exact penalty functions for nonlinear integer programming problems
- Knapsack feasibility as an absolute value equation solvable by successive linear programming
- Penalty formulation for zero-one nonlinear programming
- Topics in semidefinite and interior-point methods
- Penalty parameter for linearly constrained 0--1 quadratic programming
- Penalty for zero–one integer equivalent problem
- An exact penalty approach for solving a class of minimization problems with boolean variables
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
- Constructing test functions for global optimization using continuous formulations of graph problems
- Introduction to global optimization.
- Finding independent sets in a graph using continuous multivariable polynomial formulations.
