A primal-dual potential reduction method for problems involving matrix inequalities (Q1922696): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An implementation of Karmarkar's algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4323601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combined phase I-phase II scaled potential algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5527032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Potential Reduction Polynomial Time Method for Truss Topology Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Method of centers for minimizing generalized eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Matrix Inequalities in System and Control Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5583564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nonlinear Programming Problem in Statistics (Educational Testing) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-Definite Matrix Constraints in Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of the Sylvester matrix equation AXB <sup> <i>T</i> </sup> + CXD <sup> <i>T</i> </sup> = E / rank
 
Normal rank
Property / cites work
 
Property / cites work: On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relaxed version of Karmarkar's method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Self-Correcting Version of Karmarkar’s Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hessenberg-Schur method for the problem AX + XB= C / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path-Following Methods for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $O(\sqrt{n} L)$-Iteration Large-Step Primal-Dual Affine Algorithm for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Interior-Point Method for Minimizing the Maximum Eigenvalue of a Linear Combination of Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasibility issues in a primal-dual interior-point method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementations of Affine Scaling Methods: Approximate Solutions of Systems of Linear Equations Using Preconditioned Conjugate Gradient Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior path following primal-dual algorithms. II: Convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Minimizing the Maximum Eigenvalue of a Symmetric Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-Scale Optimization of Eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Minimum Trace Factor Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n^ 3L)\) potential reduction algorithm for linear programming / rank
 
Normal rank

Revision as of 13:32, 24 May 2024

scientific article
Language Label Description Also known as
English
A primal-dual potential reduction method for problems involving matrix inequalities
scientific article

    Statements

    A primal-dual potential reduction method for problems involving matrix inequalities (English)
    0 references
    0 references
    0 references
    11 March 1997
    0 references
    semidefinite programming
    0 references
    potential reduction method
    0 references
    matrix inequalities
    0 references
    worst-case analysis
    0 references
    interior-point methods
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers