Smoothing approximation to l₁ exact penalty function for inequality constrained optimization
From MaRDI portal
Publication:2018997
DOI10.1016/J.AMC.2012.09.042zbMATH Open1309.90103OpenAlexW2046788573MaRDI QIDQ2018997FDOQ2018997
Publication date: 26 March 2015
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2012.09.042
Recommendations
- Smoothing approximation to \(l_{1}\) exact penalty function for constrained optimization problems
- On smoothing $l_1$ exact penalty function for constrained optimization problems
- scientific article; zbMATH DE number 1559431
- Smoothing of the lower-order exact penalty function for inequality constrained optimization
- Second-order smoothing approximation to \(l_1\) exact penalty function for nonlinear constrained optimization problems
constrained optimizationsmooth exact penalty functionexact penalty functionsecond order sufficient condition
Cites Work
- Non-Linear Programming Via Penalty Functions
- On smoothing exact penalty functions for nonlinear constrained optimization problems
- Quadratic smoothing approximation to \(l_{1}\) exact penalty function in global optimazation
- On Smoothing Exact Penalty Functions for Convex Constrained Optimization
- An exact lower order penalty function and its smoothing in nonlinear programming
- Title not available (Why is that?)
- Lower order calmness and exact penalty function
- On the smoothing of the square-root exact penalty function for inequality constrained optimization
- A globally convergent algorithm for exact penalty functions
- A nonlinear programming algorithm based on non-coercive penalty functions
- Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming
- Value-estimation function method for constrained global optimization
Cited In (20)
- Smoothing approximation to the lower order exact penalty function for inequality constrained optimization
- An accelerated augmented Lagrangian method for multi-criteria optimization problem
- A linearly convergent algorithm for sparse signal reconstruction
- Lower-order smoothed objective penalty functions based on filling properties for constrained optimization problems
- On a new smoothing technique for non-smooth, non-convex optimization
- Two Classes of Smooth Objective Penalty Functions for Constrained Problems
- Second-order smoothing approximation to \(l_1\) exact penalty function for nonlinear constrained optimization problems
- High-order sum-of-squares structured tensors: theory and applications
- New Smoothing Approximations to Piecewise Smooth Functions and Applications
- HIGH-ORDER COPOSITIVE TENSORS AND ITS APPLICATIONS
- On Smoothingl1Exact Penalty Function for Constrained Optimization Problems
- A filled penalty function method for solving constrained optimization problems
- Smoothing of the lower-order exact penalty function for inequality constrained optimization
- A new smoothing approach to exact penalty functions for inequality constrained optimization problems
- Smoothing Approximation to the New Exact Penalty Function with Two Parameters
- Generalization of hyperbolic smoothing approach for non-smooth and non-Lipschitz functions
- An approach to solve local and global optimization problems based on exact objective filled penalty functions
- Title not available (Why is that?)
- Quadratic smoothing approximation to \(l_{1}\) exact penalty function in global optimazation
- An objective penalty function-based method for inequality constrained minimization problem
This page was built for publication: Smoothing approximation to \(l_1\) exact penalty function for inequality constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018997)
