Applications of convex separable unconstrained nonsmooth optimization to numerical approximation with respect to l1- and l∞-norms

DOI10.1080/09720502.2007.10700532MaRDI QIDQ5455173zbMATH OpenOpenAlexFDO

Authors S. M. Stefanov

Publication date 3 April 2008

Published in Journal of Interdisciplinary Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09720502.2007.10700532

zbMATH Keywords

inconsistent (overdetermined) systems of linear equationssubgradient methodsweighted \(\ell_p\)-norms

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Nonlinear programming (90C30)

Recommendations

• Nonsmooth Cone-Constrained Optimization with Applications to Semi-Infinite Programming
• scientific article; zbMATH DE number 2123490
• Nonconvex approximations in unconstrained minimization
• On the convexification procedure for nonconvex and nonsmooth infinite dimensional optimization problems
• Abstract convex approximations of nonsmooth functions
• Approximate optimality for quasi approximate solutions in nonsmooth semi-infinite programming problems, using \(\varepsilon\)-upper semi-regular semi-convexificators
• scientific article; zbMATH DE number 2133301
• A general approach to convergence properties of some methods for nonsmooth convex optimization
• On the degree and separability of nonconvexity and applications to optimization problems
• Approximate solutions in nonsmooth and nonconvex cone constrained vector optimization

Cites work

• A Global and Quadratically Convergent Method for Linear $l_\infty $ Problems
• A globally and quadratically convergent affine scaling method for linear \(l_ 1\) problems
• A Globally Convergent Method for l_p Problems
• A New Class of Incremental Gradient Methods for Least Squares Problems
• A projected newton method forl p norm location problems
• A quadratically convergent method for minimizing a sum of euclidean norms
• A Stable Algorithm for Solving the Multifacility Location Problem Involving Euclidean Distances
• A subgradient algorithm for certain minimax and minisum problems
• An algorithm for discrete linear \(L_ p\) approximation
• An Efficient Algorithm for Discrete $l_1$ Linear Approximation with Linear Constraints
• An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
• An Efficient Newton Barrier Method for Minimizing a Sum of Euclidean Norms
• An Improved Algorithm for Discrete l₁ Linear Approximation
• Computational experiences with discrete L\(_p\)-approximation
• Functional Analysis
• scientific article; zbMATH DE number 3884755 (Why is no real title available?)
• scientific article; zbMATH DE number 1266748 (Why is no real title available?)
• scientific article; zbMATH DE number 852525 (Why is no real title available?)
• scientific article; zbMATH DE number 852536 (Why is no real title available?)
• Minimization Techniques for Piecewise Differentiable Functions: The l₁ Solution to an Overdetermined Linear System
• On the convergence of an algorithm for discrete L_p approximation
• On two methods for discrete \(L_p\) approximation

Cited in

(2)

• Optimality conditions for best L₁ data fitting subject to nonnegative second differences
• scientific article; zbMATH DE number 1069179 (Why is no real title available?)

This page was built for publication: Applications of convex separable unconstrained nonsmooth optimization to numerical approximation with respect to l₁- and l_∞-norms

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