An algorithm for a nonlinear l₁ problem

MaRDI QIDQ5399914zbMATH OpenFDO

Authors Shengrong Ma, Xinghua You

Publication date 28 February 2014

zbMATH Keywords

interior point algorithm\(l_1\) problemquadratic programming problem with box constraints

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Recommendations

• Combined LP and Quasi-Newton Methods for Nonlinear $l_1 $ Optimization
• Solving a nonlinear \(l_1\) problem based on a smoothing function method
• A smooth approximation method for nonlinear \(l_1\) problem
• A Base-Point Descent Algorithm For Solving The Linear l 1 Problem
• Numerical algorithms for nonlinear \(L_p\)-norm problem and its extreme case

Cited in

(10)

• A smooth approximation method for nonlinear \(l_1\) problem
• A Base-Point Descent Algorithm For Solving The Linear l 1 Problem
• scientific article; zbMATH DE number 4093195 (Why is no real title available?)
• The linearized version of an algorithm for the mixed norms problem
• Combined LP and Quasi-Newton Methods for Nonlinear $l_1 $ Optimization
• Solving a nonlinear \(l_1\) problem based on a smoothing function method
• scientific article; zbMATH DE number 147744 (Why is no real title available?)
• Optimality conditions for the \(L_{1/2}\) regularization problem and a descent method
• scientific article; zbMATH DE number 7612933 (Why is no real title available?)
• The L₁-version of the Diliberto–Straus algorithm in C(T × S)

This page was built for publication: An algorithm for a nonlinear \(l_1\) problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5399914)