Skip to main content
Article thumbnail
Location of Repository

Exactness Conditions for a Convex Differentiable Exterior Penalty for Linear Programming

By Edward Wild and Olvi Mangasarian

Abstract

Sufficient conditions are given for a classical dual exterior penalty function of a linear program to be independent of its penalty parameter. This ensures that an exact solution to the primal linear program can be obtained by minimizing the dual exterior penalty function. The sufficient conditions give a precise value to such a penalty parameter introduced in (Mangasarian, 2005), where no quantification of the parameter was given. Computational results on linear programs with up to one million variables or constraints compare favorably to CPLEX 9.0 (ILO, 2003) and validate the proposed approach

Topics: explicit penalty parameter magnitude, exact penalty function, linear programming
Year: 2007
OAI identifier: oai:minds.wisconsin.edu:1793/64344

Suggested articles

Citations

  1. (2001). A finite Newton method for classification problems.
  2. (1970). Convex Analysis.
  3. (2005). Exact 1-Norm support vector machines via unconstrained convex differentiable minimization.
  4. (1984). Generalized Hessian matrix and second-order optimality conditions for problems with CL1 data.
  5. (1995). Minimization of SC1 functions and the Maratos effect.
  6. (1995). Parallel gradient distribution in unconstrained optimization.

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.