A full step infeasible interior-point method for Cartesian \(P_{*}(\kappa)\)-SCLCP (Q279828): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4321748 / 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: Euclidean Jordan algebras and interior-point 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 new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new interior-point algorithm based on modified Nesterov-Todd direction for symmetric cone linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to interior point algorithms for linear complementary problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infeasible interior-point algorithm with full-Newton step for linear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-Scaled Barriers and Interior-Point Methods for Convex Programming / 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: An Improved and Simplified Full-Newton Step $O(n)$ Infeasible Interior-Point Method for Linear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339096 / 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 class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Full Nesterov–Todd step feasible interior-point method for the Cartesian<i>P</i><sub>*</sub>(κ)-SCLCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplified analysis for full-Newton step infeasible interior-point algorithm for semidefinite programming / rank
 
Normal rank

Latest revision as of 21:02, 11 July 2024

scientific article
Language Label Description Also known as
English
A full step infeasible interior-point method for Cartesian \(P_{*}(\kappa)\)-SCLCP
scientific article

    Statements

    A full step infeasible interior-point method for Cartesian \(P_{*}(\kappa)\)-SCLCP (English)
    0 references
    0 references
    29 April 2016
    0 references
    Cartesian \(P_*(\kappa)\) linear complementarity problem
    0 references
    infeasible interior-point method
    0 references
    polynomial complexity
    0 references
    0 references
    0 references

    Identifiers