On the smoothing of the square-root exact penalty function for inequality constrained optimization
From MaRDI portal
Publication:861516
DOI10.1007/s10589-006-8720-6zbMath1128.90055MaRDI QIDQ861516
Chuangyin Dang, Xiao Qi Yang, Zhiqing Meng
Publication date: 29 January 2007
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-006-8720-6
constrained optimization; penalty function; optimal solution; smoothing method; exact penalty function; \(\varepsilon\)-feasible solution,
Related Items
On the convergence of a smooth penalty algorithm without computing global solutions, A penalty function method based on smoothing lower order penalty function, On smoothing exact penalty functions for nonlinear constrained optimization problems, A Smoothing Objective Penalty Function Algorithm for Inequality Constrained Optimization Problems
Cites Work
- On the exactness of a class of nondifferentiable penalty functions
- A globally convergent algorithm for exact penalty functions
- Space-times of low differentiability and singularities
- Entropy optimization and mathematical programming
- Semismooth Newton methods for solving semi-infinite programming problems
- Smoothing methods for convex inequalities and linear complementarity problems
- Scheduling with monotonous earliness and tardiness penalties
- Exact penalty functions and stability in locally Lipschitz programming
- An exact penalty function method with global convergence properties for nonlinear programming problems
- Exact penalty functions in nonlinear programming
- On Smoothing Exact Penalty Functions for Convex Constrained Optimization
- Smoothing Nonlinear Penalty Functions for Constrained Optimization Problems
- Globally Convergent Algorithms for Convex Programming
- Non-Linear Programming Via Penalty Functions
- Computational discretization algorithms for functional inequality constrained optimization
