Quadratic smoothing approximation to l₁ exact penalty function in global optimazation
From MaRDI portal
Publication:2583326
Recommendations
- Smoothing approximation to l₁ exact penalty function for inequality constrained optimization
- Smoothing approximation to \(l_{1}\) exact penalty function for constrained optimization problems
- Second-order smoothing approximation to l₁ exact penalty function for nonlinear constrained optimization problems
- On smoothing $l_1$ exact penalty function for constrained optimization problems
- A smoothing exact penalty function algorithm for nonlinear constrained optimization problems
Cited in
(10)- An objective penalty function-based method for inequality constrained minimization problem
- Smoothing approximation to l₁ exact penalty function for inequality constrained optimization
- A novel penalty function method for semivectorial bilevel programming problem
- A new smoothing approach to exact penalty functions for inequality constrained optimization problems
- A second-order smooth penalty function algorithm for constrained optimization problems
- Second-Order Smoothing Objective Penalty Function for Constrained Optimization Problems
- Quadratic error bound of the smoothed gap and the restarted averaged primal-dual hybrid gradient
- A novel class of exact penalty function approach for optimization problems with inequality constraints
- On smoothing l₁ exact penalty function for nonlinear constrained optimization problems
- Smoothing approximation to the lower order exact penalty function for inequality constrained optimization
This page was built for publication: Quadratic smoothing approximation to \(l_{1}\) exact penalty function in global optimazation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583326)
