A dual differentiable exact penalty function

DOI10.1007/BF02594781zbMath0495.90070MaRDI QIDQ3959752

Olvi L. Mangasarian, Shih-Ping Han

Publication date: 1983

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

dual problemsuccessive overrelaxationpenalty functionglobal differentiabilityinequality constrained nonlinear programming problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items

Sparsity-preserving SOR algorithms for separable quadratic and linear programming, A note on a quadratic formulation for linear complementarity problems, Exact penalty functions and stability in locally Lipschitz programming, A dual exact penalty formulation for the linear complementarity problem, An LP-based successive overrelaxation method for linear complementarity problems, PARALLEL MULTISPLITTINGS FOR OPTIMIZATION∗, PARALLEL MULTISPLITTINGS FOR CONSTRAINED OPTIMIZATION, Solving multiple criteria problems by interactive decomposition, A simple smooth exact penalty function for smooth optimization problem, A new class of exact penalty functions and penalty algorithms, On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems, Global Convergence of a Trust Region Algorithm for Nonlinear Inequality Constrained Optimization Problems, Wolfe-type duality for mathematical programs with equilibrium constraints, \(\varepsilon\)-optimality and duality for multiobjective fractional programming, More results on the convergence of iterative methods for the symmetric linear complementarity problem, A continuously differentiable exact penalty function for nonlinear programming problems with unbounded feasible set

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Least-norm linear programming solution as an unconstrained minimization problem
• Augmented Lagrangians which are quadratic in the multiplier
• Enlarging the region of convergence of Newton's method for constrained optimization
• A stable theorem of the alternative: An extension of the Gordan theorem
• A globally convergent method for nonlinear programming
• Solution of symmetric linear complementarity problems by iterative methods
• Duality in quadratic programming
• Proof of Convergence for a Modification of Goldfarb's Algorithm
• A duality theorem for non-linear programming
• A New Class of Augmented Lagrangians in Nonlinear Programming
• Exact penalty functions in nonlinear programming
• Iterative Solution of Linear Programs
• Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
• Superlinearly convergent variable metric algorithms for general nonlinear programming problems
• Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints