A wide neighborhood interior-point method for Cartesian \(P_*(\kappa )\)-LCP over symmetric cones (Q888311): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
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: On a commutative class of search directions for linear programming over 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 unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>O</i>$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with $O(\sqrt{n}\log\frac{\mathrm{Tr}(X^0S^0)}{\epsilon})$ Iteration Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming / 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: Polynomial convergence of Mehrotra-type predictor–corrector algorithm for the Cartesian<i>P</i><sub>∗</sub>(κ)-LCP over symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior-point methods for Cartesian<i>P</i><sub>*</sub>(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions / 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: 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: Q4321748 / rank
 
Normal rank

Revision as of 23:27, 10 July 2024

scientific article
Language Label Description Also known as
English
A wide neighborhood interior-point method for Cartesian \(P_*(\kappa )\)-LCP over symmetric cones
scientific article

    Statements

    A wide neighborhood interior-point method for Cartesian \(P_*(\kappa )\)-LCP over symmetric cones (English)
    0 references
    0 references
    0 references
    30 October 2015
    0 references
    infeasible-interior-point method
    0 references
    symmetric cone optimization
    0 references
    \(P_*(\kappa )\)-property
    0 references
    wide neighborhood
    0 references
    0 references

    Identifiers