Primal-dual interior point approach for computing \(l_ 1\)-solutions and \(l_ \infty\)-solutions of overdetermined linear systems (Q1321337): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: An Improved Algorithm for Discrete $l_1 $ Linear Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization Techniques for Piecewise Differentiable Functions: The $l_1$ Solution to an Overdetermined Linear System / rank
 
Normal rank
Property / cites work
 
Property / cites work: Column Relaxation Methods for Least Norm Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A least-squares-based method for a class of nonsmooth minimization problems with applications in plasticity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692623 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior path following primal-dual algorithms. I: Linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further Development of a Primal-Dual Interior Point Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with a primal-dual interior point method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Implementation of a Primal-Dual Interior Point Method for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Mehrotra Predictor-Corrector Interior-Point Method As a Perturbed Composite Newton Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding a vertex solution using interior point methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Implementation of a Primal-Dual Interior Point Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf00940715 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2075403875 / rank
 
Normal rank

Latest revision as of 08:49, 30 July 2024

scientific article
Language Label Description Also known as
English
Primal-dual interior point approach for computing \(l_ 1\)-solutions and \(l_ \infty\)-solutions of overdetermined linear systems
scientific article

    Statements

    Primal-dual interior point approach for computing \(l_ 1\)-solutions and \(l_ \infty\)-solutions of overdetermined linear systems (English)
    0 references
    27 April 1994
    0 references
    \(l_ 1\)-solution
    0 references
    \(l_ \infty\)-solution
    0 references
    quadratic convergence
    0 references
    overdetermined linear system
    0 references
    primal-dual interior point approach
    0 references
    superlinear convergence rate
    0 references
    0 references

    Identifiers