Exact penalty functions for nonlinear integer programming problems
From MaRDI portal
Publication:983724
DOI10.1007/S10957-010-9700-7zbMATH Open1206.90100OpenAlexW2094034289MaRDI QIDQ983724FDOQ983724
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Topics in semidefinite and interior-point methods
- Introduction to global optimization.
- An algorithm for nonlinear optimization problems with binary variables
- Exact penalty functions for nonlinear integer programming problems
- Penalty formulation for zero-one nonlinear programming
- 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
- Knapsack feasibility as an absolute value equation solvable by successive linear programming
- Constructing test functions for global optimization using continuous formulations of graph problems
- Finding independent sets in a graph using continuous multivariable polynomial formulations.
- New results on the equivalence between zero-one programming and continuous concave programming
Cited In (23)
- Feasibility Pump-like heuristics for mixed integer problems
- New exact penalty functions for nonlinear constrained optimization problems
- On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems
- An improved penalty algorithm using model order reduction for MIPDECO problems with partial observations
- Continuous reformulations for zero-one programming problems
- On choosing initial values of iteratively reweighted \(\ell_1\) algorithms for the piece-wise exponential penalty
- Title not available (Why is that?)
- An exact minimax penalty function method and saddle point criteria for nonsmooth convex vector optimization problems
- An exact \(l_1\) exponential penalty function method for multiobjective optimization problems with exponential-type invexity
- Multiplicative method for exact penalty functions for linear and integer linear programming problems
- Evolution differential inclusion with projection for solving constrained nonsmooth convex optimization in Hilbert space
- Exact penalty functions for nonlinear integer programming problems
- Continuous quadratic programming formulations of optimization problems on graphs
- Partially strictly monotone and nonlinear penalty functions for constrained mathematical programs
- Exact penalty functions in linear and integer linear programming
- Improved penalty algorithm for mixed integer PDE constrained optimization problems
- Optimality conditions for mixed discrete bilevel optimization problems
- Exact penalty and optimality condition for nonseparable continuous piecewise linear programming
- A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems
- A Computational Framework for Solving Nonlinear Binary Optimization Problems in Robust Causal Inference
- Firefly penalty-based algorithm for bound constrained mixed-integer nonlinear programming
- An exact penalty function method for nonlinear mixed discrete programming problems
- An exact penalty global optimization approach for mixed-integer programming problems
This page was built for publication: Exact penalty functions for nonlinear integer programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q983724)
