Smoothing Nonlinear Penalty Functions for Constrained Optimization Problems
From MaRDI portal
Publication:4412389
DOI10.1081/NFA-120022928zbMath1023.90066MaRDI QIDQ4412389
Zhiqing Meng, G. T. Y. Pong, Xiao Qi Yang, Xue Xiang Huang
Publication date: 14 July 2003
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
constrained optimizationoptimal solutionsmoothing methodnonlinear penalty function\(\varepsilon\)-feasible solution
Related Items
A Smoothing Objective Penalty Function Algorithm for Inequality Constrained Optimization Problems ⋮ An M-objective penalty function algorithm under big penalty parameters ⋮ On the smoothing of the square-root exact penalty function for inequality constrained optimization ⋮ The smoothing objective penalty function method for two-cardinality sparse constrained optimization problems ⋮ A second-order smooth penalty function algorithm for constrained optimization problems ⋮ An interior-point \(\ell_{\frac{1}{2}}\)-penalty method for inequality constrained nonlinear optimization ⋮ On Smoothingl1Exact Penalty Function for Constrained Optimization Problems ⋮ Smoothing Partially Exact Penalty Function of Biconvex Programming ⋮ Second-Order Smoothing Objective Penalty Function for Constrained Optimization Problems ⋮ A penalty function method based on smoothing lower order penalty function ⋮ A robust SQP method based on a smoothing lower order penalty function†
Cites Work
- Unnamed Item
- Unnamed Item
- On the exactness of a class of nondifferentiable penalty functions
- An exterior point method for computing points that satisfy second-order necessary conditions for a \(C^{1,1}\) optimization problem
- A Nonlinear Lagrangian Approach to Constrained Optimization Problems
- Exact penalty functions and stability in locally Lipschitz programming
- On Smoothing Exact Penalty Functions for Convex Constrained Optimization
- Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming
- Trust Region Methods
- Smoothing approximations to nonsmooth optimization problems
- Decreasing Functions with Applications to Penalization
- Extended Lagrange And Penalty Functions in Continuous Optimization*