Exactness conditions for a convex differentiable exterior penalty for linear programming

DOI10.1080/02331930903100158MaRDI QIDQ2996786zbMATH OpenOpenAlexFDO

Authors E. W. Wild, O. L. Mangasarian

Publication date 3 May 2011

Published in Optimization (Search for Journal in Brave)

Full work available at URL http://digital.library.wisc.edu/1793/64344

zbMATH Keywords

linear programmingexact penalty functionexplicit penalty parameter magnitude

Mathematics Subject Classification ID

Linear programming (90C05) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Recommendations

• Sufficiency of Exact Penalty Minimization
• On using exterior penalty approaches for solving linear programming problems
• An exact penalty function method for solving linear and integer linear programming problems
• A unifying theory of exactness of linear penalty functions
• scientific article; zbMATH DE number 977754

Cites work

• scientific article; zbMATH DE number 5430994 (Why is no real title available?)
• scientific article; zbMATH DE number 1266748 (Why is no real title available?)
• A finite newton method for classification
• Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
• Minimization of \(SC^ 1\) functions and the Maratos effect
• Parallel Gradient Distribution in Unconstrained Optimization

Cited in

(2)

• Linear programming with nonparametric penalty programs and iterated thresholding
• On using exterior penalty approaches for solving linear programming problems

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: Exactness conditions for a convex differentiable exterior penalty for linear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2996786)