An infeasible interior-point algorithm for linear optimization over Cartesian symmetric cones (Q2361596): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Second-order cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity analysis and numerical implementation of a full-Newton step interior-point algorithm for LCCO / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4321748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean Jordan algebras and interior-point algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Jordan-algebraic approach to potential-reduction algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Full Nesterov-Todd step infeasible interior-point method for symmetric optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to interior point algorithms for linear complementarity problems: A summary / 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: Polynomiality of infeasible-interior-point algorithms for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified infeasible-interior-point algorithm for linear optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Similarity and other spectral relations for symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension of primal-dual interior point algorithms to symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: New complexity analysis of interior-point methods for the Cartesian \(P_\ast ({\kappa})\)-SCLCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A full-Newton step interior-point algorithm based on modified Newton direction / rank
 
Normal rank

Latest revision as of 01:14, 14 July 2024

scientific article
Language Label Description Also known as
English
An infeasible interior-point algorithm for linear optimization over Cartesian symmetric cones
scientific article

    Statements

    An infeasible interior-point algorithm for linear optimization over Cartesian symmetric cones (English)
    0 references
    0 references
    30 June 2017
    0 references
    linear optimization
    0 references
    Cartesian symmetric cone
    0 references
    interior-point methods
    0 references
    polynomial complexity
    0 references
    0 references

    Identifiers