On the convergence of a smooth penalty algorithm without computing global solutions
From MaRDI portal
Publication:411033
DOI10.1155/2012/620949zbMath1235.90120WikidataQ58906254 ScholiaQ58906254MaRDI QIDQ411033
Bingzhuang Liu, Chang-Yu Wang, Wen-Ling Zhao
Publication date: 4 April 2012
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2012/620949
65K05: Numerical mathematical programming methods
90C25: Convex programming
90C26: Nonconvex programming, global optimization
Related Items
Cites Work
- Unnamed Item
- On the smoothing of the square-root exact penalty function for inequality constrained optimization
- A nonlinear programming algorithm based on non-coercive penalty functions
- A class of smoothing functions for nonlinear and mixed complementarity problems
- Smoothing methods for convex inequalities and linear complementarity problems
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- Smoothed penalty algorithms for optimization of nonlinear models
- A smoothing-out technique for min—max optimization
- On Smoothing Exact Penalty Functions for Convex Constrained Optimization
- Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming
- An exact lower order penalty function and its smoothing in nonlinear programming
- Non-Linear Programming Via Penalty Functions