On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems

DOI10.1016/J.AMC.2015.09.020zbMath1410.90179OpenAlexW1824346227MaRDI QIDQ1732230

Cheng Ma, Lian-Sheng Zhang

Publication date: 22 March 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2015.09.020

zbMATH Keywords

exact and smooth penalty functionlinearly independent constraint qualificationlocal exactness propertynonlinear mixed discrete programming problemssearch engine advertisements

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Combinatorial optimization (90C27)

Related Items (2)

Some mathematical aspects of price optimisation ⋮ A unified approach to the global exactness of penalty and augmented Lagrangian functions. II: Extended exactness

Uses Software

• FEASPUMP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Continuous reformulations for zero-one programming problems
• On the convergence of the exponential multiplier method for convex programming
• An algorithm for nonlinear optimization problems with binary variables
• New results on the equivalence between zero-one programming and continuous concave programming
• Exact penalty results for mathematical programs with vanishing constraints
• Exact penalty functions for constrained minimization problems via regularized gap function for variational inequalities
• Existence of exact penalty for constrained optimization problems in Hilbert spaces
• Exact penalty functions for nonlinear integer programming problems
• Knapsack feasibility as an absolute value equation solvable by successive linear programming
• Exact penalty functions method for mathematical programming problems involving invex functions
• Penalty formulation for zero-one nonlinear programming
• Stable exponential-penalty algorithm with superlinear convergence
• Error bounds in mathematical programming
• Smoothing SQP algorithm for semismooth equations with box constraints
• Feasibility Pump-like heuristics for mixed integer problems
• An Augmented Lagrangian Function with Improved Exactness Properties
• A New Class of Functions for Measuring Solution Integrality in the Feasibility Pump Approach
• An Automatic Method of Solving Discrete Programming Problems
• Penalty for zero–one integer equivalent problem
• Calmness and Exact Penalization
• An exact penalty function method with global convergence properties for nonlinear programming problems
• An exact penalty approach for solving a class of minimization problems with boolean variables
• Exact penalty functions in nonlinear programming
• A dual differentiable exact penalty function
• An Exact Penalization Viewpoint of Constrained Optimization
• An exact penalty function for nonlinear programming with inequalities
• A New Exact Penalty Function
• Nonlinear Programming
• On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
• Exact penalty functions in nonlinear programming
• Constructing test functions for global optimization using continuous formulations of graph problems
• Finding independent sets in a graph using continuous multivariable polynomial formulations.

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