Applications of convex separable unconstrained nonsmooth optimization to numerical approximation with respect to l1- and l∞-norms
From MaRDI portal
Publication:5455173
DOI10.1080/09720502.2007.10700532zbMath1192.90204OpenAlexW2319324579MaRDI QIDQ5455173
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
subgradient methodsinconsistent (overdetermined) systems of linear equationsweighted \(\ell_p\)-norms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the convergence of an algorithm for discrete \(L_p\) approximation
- An algorithm for discrete linear \(L_ p\) approximation
- A globally and quadratically convergent affine scaling method for linear \(l_ 1\) problems
- On two methods for discrete \(L_p\) approximation
- Computational experiences with discrete L\(_p\)-approximation
- A Globally Convergent Method for $l_p $ Problems
- A quadratically convergent method for minimizing a sum of euclidean norms
- A projected newton method forl p norm location problems
- A Stable Algorithm for Solving the Multifacility Location Problem Involving Euclidean Distances
- A Global and Quadratically Convergent Method for Linear $l_\infty $ Problems
- Minimization Techniques for Piecewise Differentiable Functions: The $l_1$ Solution to an Overdetermined Linear System
- An Efficient Algorithm for Discrete $l_1$ Linear Approximation with Linear Constraints
- A subgradient algorithm for certain minimax and minisum problems
- A New Class of Incremental Gradient Methods for Least Squares Problems
- An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
- Functional Analysis
- An Efficient Newton Barrier Method for Minimizing a Sum of Euclidean Norms
- An Improved Algorithm for Discrete $l_1 $ Linear Approximation
