A dual differentiable exact penalty function
From MaRDI portal
Publication:3959752
DOI10.1007/BF02594781zbMATH Open0495.90070MaRDI QIDQ3959752FDOQ3959752
Authors: Shih-Ping Han, O. L. Mangasarian
Publication date: 1983
Published in: Mathematical Programming (Search for Journal in Brave)
penalty functionsuccessive overrelaxationdual problemglobal differentiabilityinequality constrained nonlinear programming problem
Cites Work
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- Title not available (Why is that?)
- A globally convergent method for nonlinear programming
- Exact penalty functions in nonlinear programming
- Title not available (Why is that?)
- Solution of symmetric linear complementarity problems by iterative methods
- Duality in quadratic programming
- Title not available (Why is that?)
- Enlarging the region of convergence of Newton's method for constrained optimization
- A New Class of Augmented Lagrangians in Nonlinear Programming
- Title not available (Why is that?)
- A duality theorem for non-linear programming
- Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
- Iterative Solution of Linear Programs
- Least-norm linear programming solution as an unconstrained minimization problem
- Augmented Lagrangians which are quadratic in the multiplier
- A stable theorem of the alternative: An extension of the Gordan theorem
- Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
- Proof of Convergence for a Modification of Goldfarb's Algorithm
Cited In (16)
- Global Convergence of a Trust Region Algorithm for Nonlinear Inequality Constrained Optimization Problems
- Solving multiple criteria problems by interactive decomposition
- An LP-based successive overrelaxation method for linear complementarity problems
- On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems
- Exact penalty functions and stability in locally Lipschitz programming
- PARALLEL MULTISPLITTINGS FOR OPTIMIZATION∗
- PARALLEL MULTISPLITTINGS FOR CONSTRAINED OPTIMIZATION
- \(\varepsilon\)-optimality and duality for multiobjective fractional programming
- A continuously differentiable exact penalty function for nonlinear programming problems with unbounded feasible set
- A note on a quadratic formulation for linear complementarity problems
- Sparsity-preserving SOR algorithms for separable quadratic and linear programming
- Wolfe-type duality for mathematical programs with equilibrium constraints
- More results on the convergence of iterative methods for the symmetric linear complementarity problem
- A new class of exact penalty functions and penalty algorithms
- A dual exact penalty formulation for the linear complementarity problem
- A simple smooth exact penalty function for smooth optimization problem
This page was built for publication: A dual differentiable exact penalty function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3959752)