Second-Order Smoothing Objective Penalty Function for Constrained Optimization Problems
From MaRDI portal
Publication:5409739
DOI10.1080/01630563.2013.811421zbMath1295.65071OpenAlexW1981949205MaRDI QIDQ5409739
Rui Shen, Min Jiang, Zhiqing Meng, Xin-Sheng Xu
Publication date: 14 April 2014
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630563.2013.811421
algorithmglobal convergencesmoothing techniquenumerical resultconstrained optimization problemobjective penalty functionobjective parameter
Related Items
The smoothing objective penalty function method for two-cardinality sparse constrained optimization problems ⋮ A New Smoothing Approach for Piecewise Smooth Functions: Application to Some Fundamental Functions ⋮ New Smoothing Approximations to Piecewise Smooth Functions and Applications ⋮ Smoothing of the lower-order exact penalty function for inequality constrained optimization ⋮ Smoothing approximations for piecewise smooth functions: a probabilistic approach
Cites Work
- Unnamed Item
- Unnamed Item
- A second-order smooth penalty function algorithm for constrained optimization problems
- A penalty function method based on smoothing lower order penalty function
- On the smoothing of the square-root exact penalty function for inequality constrained optimization
- A globally convergent algorithm for exact penalty functions
- Semismooth Newton methods for solving semi-infinite programming problems
- Convergence analysis of a class of nonlinear penalization methods for constrained optimization via first-order necessary optimality conditions
- A Boolean penalty method for zero-one nonlinear programming
- An objective penalty function method for nonlinear programming.
- Smoothing methods for convex inequalities and linear complementarity problems
- A penalty function algorithm with objective parameters for nonlinear mathematical programming
- Quadratic smoothing approximation to \(l_{1}\) exact penalty function in global optimazation
- A Nonlinear Lagrangian Approach to Constrained Optimization Problems
- A Smoothing Objective Penalty Function Algorithm for Inequality Constrained Optimization Problems
- A robust SQP method based on a smoothing lower order penalty function†
- Exact penalty functions in nonlinear programming
- Discontinuous Optimization by Smoothing
- Sufficient conditions for a globally exact penalty function without convexity
- An Exact Penalization Viewpoint of Constrained Optimization
- On Smoothing Exact Penalty Functions for Convex Constrained Optimization
- Penalty functions with a small penalty parameter
- Smoothing Nonlinear Penalty Functions for Constrained Optimization Problems
- An exact lower order penalty function and its smoothing in nonlinear programming
- Strictly Increasing Positively Homogeneous Functions with Application to Exact Penalization
- Exact Penalty Functions in Constrained Optimization
- Smoothing approximations to nonsmooth optimization problems
- Decreasing Functions with Applications to Penalization
- Extended Lagrange And Penalty Functions in Continuous Optimization*
- Sufficiency of Exact Penalty Minimization
- Optimization by Least Squares
