On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems
From MaRDI portal
Publication:1732230
Recommendations
Cites work
- A dual differentiable exact penalty function
- A new class of functions for measuring solution integrality in the feasibility pump approach
- A New Exact Penalty Function
- An algorithm for nonlinear optimization problems with binary variables
- An augmented Lagrangian function with improved exactness properties
- An Automatic Method of Solving Discrete Programming Problems
- An Exact Penalization Viewpoint of Constrained Optimization
- An exact penalty approach for solving a class of minimization problems with boolean variables
- An exact penalty function for nonlinear programming with inequalities
- An exact penalty function method with global convergence properties for nonlinear programming problems
- Calmness and Exact Penalization
- Constructing test functions for global optimization using continuous formulations of graph problems
- Continuous approaches for solving discrete optimization problems
- Continuous reformulations for zero-one programming problems
- Error bounds in mathematical programming
- Exact penalty functions for constrained minimization problems via regularized gap function for variational inequalities
- Exact penalty functions for nonlinear integer programming problems
- Exact penalty functions in nonlinear programming
- Exact penalty functions in nonlinear programming
- Exact penalty functions method for mathematical programming problems involving invex functions
- Exact penalty results for mathematical programs with vanishing constraints
- Existence of exact penalty for constrained optimization problems in Hilbert spaces
- Feasibility Pump-like heuristics for mixed integer problems
- Finding independent sets in a graph using continuous multivariable polynomial formulations.
- scientific article; zbMATH DE number 3534294 (Why is no real title available?)
- scientific article; zbMATH DE number 3373541 (Why is no real title available?)
- Knapsack feasibility as an absolute value equation solvable by successive linear programming
- New results on the equivalence between zero-one programming and continuous concave programming
- Nonlinear Programming
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
- On the convergence of the exponential multiplier method for convex programming
- Penalty for zero–one integer equivalent problem
- Penalty formulation for zero-one nonlinear programming
- Smoothing SQP algorithm for semismooth equations with box constraints
- Stable exponential-penalty algorithm with superlinear convergence
Cited in
(3)
This page was built for publication: On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1732230)