A Globally Convergent Method for l_p Problems

DOI10.1137/0803030MaRDI QIDQ3140006zbMATH OpenOpenAlexFDO

Authors Yuying Li

Publication date 23 January 1994

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0803030

zbMATH Keywords

linear programmingdata analysisglobal convergenceNewton methodsuperlinear convergencesimplex methodinterior-point algorithmNumerical experimentsdiscrete estimationiteratively reweighted least squares method\(l_ p\)-norm discrete estimation problemIRLS method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Recommendations

• Numerical algorithms for nonlinear \(L_p\)-norm problem and its extreme case
• Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
• Iterative reweighted methods for \(\ell _1-\ell _p\) minimization
• A Finite Smoothing Algorithm for Linear $l_1 $ Estimation
• scientific article; zbMATH DE number 1086510

Cited in

(25)

• Properties of _p-norm errors in signal recovery
• Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
• A projected newton method forl p norm location problems
• A globally convergent descent method for nonsmooth variational inequalities
• Univariate \(L^p\) and \(l^p\) averaging, \(0<p<1\), in polynomial time by utilization of statistical structure
• Approximation in normed linear spaces
• The method IRLs for some best _p norm solutions of under- or overdetermined linear systems
• scientific article; zbMATH DE number 5371452 (Why is no real title available?)
• A simple globally convergent algorithm for the nonsmooth nonconvex single source localization problem
• Numerical algorithms for solving nonlinear l -norm estimation problems: Part i - a first-order gradient algorithm for well-conditioned small residual problems
• A globally convergent LP-Newton method
• Applications of convex separable unconstrained nonsmooth optimization to numerical approximation with respect to l₁- and l_∞-norms
• An iterative algorithm for \(l_1\)-norm approximation in dynamic estimation problems
• A Laplacian approach to _1-norm minimization
• A globally convergent Newton method for convex \(SC^ 1\) minimization problems
• A primal-dual interior-point framework for using the L1 or L2 norm on the data and regularization terms of inverse problems
• Column Relaxation Methods for Least Norm Problems
• Numerical algorithms for solving nonlinearL_р-norm estimation problems: part II - a mixture method for large residual and illo-conditioned problems
• On the application of iterative methods of nondifferentiable optimization to some problems of approximation theory
• Numerical algorithms for nonlinear \(L_p\)-norm problem and its extreme case
• A unified analysis of convex and non-convex \(\ell_p\)-ball projection problems
• Sparse and nonnegative sparse D-MORPH regression
• Use of reference distributions when dealing with unknown regression errors
• On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds
• scientific article; zbMATH DE number 3903837 (Why is no real title available?)

This page was built for publication: A Globally Convergent Method for $l_p $ Problems

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