Smoothing approximation to the square-order exact penalty functions for constrained optimization
Summary: A method is proposed to smooth the square-order exact penalty function for inequality constrained optimization. It is shown that, under some conditions, an approximately optimal solution of the original problem can be obtained by searching an approximately optimal solution of the smoothed penalty problem. An algorithm based on the smoothed penalty functions is given. The algorithm is shown to be convergent under mild conditions. Two numerical examples show that the algorithm seems efficient.
- Smoothing approximation to \(l_{1}\) exact penalty function for constrained optimization problems
- On Smoothing Exact Penalty Functions for Convex Constrained Optimization
- scientific article; zbMATH DE number 1559431
- Smoothing approximation to the lower order exact penalty function for inequality constrained optimization
- On smoothing exact penalty functions for nonlinear constrained optimization problems
- On the smoothing of the square-root exact penalty function for inequality constrained optimization
- scientific article; zbMATH DE number 6263697
- A smoothing exact penalty function algorithm for nonlinear constrained optimization problems
- Smoothing Nonlinear Penalty Functions for Constrained Optimization Problems
- On smoothing $l_1$ exact penalty function for constrained optimization problems
- On smoothing exact penalty functions for nonlinear constrained optimization problems
- An objective penalty function-based method for inequality constrained minimization problem
- Theoretical aspect of diagonal Bregman proximal methods
- Exact penalization in stochastic programming -- calmness and constraint qualification
- Second-order smoothing approximation to l₁ exact penalty function for nonlinear constrained optimization problems
- Smoothing techniques for exact penalty methods
- A second-order smooth penalty function algorithm for constrained optimization problems
- Smoothing Nonlinear Penalty Functions for Constrained Optimization Problems
- On smoothing $l_1$ exact penalty function for constrained optimization problems
- On the smoothing of the lower order exact penalty function for inequality constrained optimization
- Modified lower order penalty functions based on quadratic smoothing approximation
- scientific article; zbMATH DE number 6263697 (Why is no real title available?)
- Second-Order Smoothing Objective Penalty Function for Constrained Optimization Problems
- Smoothing approach of lower order exact penalty function for nonlinear constrained optimization problems
- Smoothing of the lower-order exact penalty function for inequality constrained optimization
- Smoothing approximation to the lower order exact penalty function for inequality constrained optimization
- On the smoothing of the square-root exact penalty function for inequality constrained optimization
This page was built for publication: Smoothing approximation to the square-order exact penalty functions for constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1790006)
