An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones (Q2970393): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/02331934.2016.1267732 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2561720919 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Barrier Functions in Interior Point Methods / 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: Primal-Dual Interior-Point Methods for Self-Scaled Cones / 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: Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones / 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 <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: On the Convergence of the Iteration Sequence of Infeasible Path Following Algorithms for Linear Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: EP theorem for dual linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial path-following interior point algorithm for general linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm for a class of linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrector‐Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path / rank
 
Normal rank
Property / cites work
 
Property / cites work: A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with \(O(\sqrt nL)\)-iteration complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A superquadratic infeasible-interior-point method for linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On homogeneous and self-dual algorithms for LCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP / 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: 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: Infeasible Mehrotra-Type Predictor-Corrector Interior-Point Algorithm for the Cartesian<b><i>P</i></b><sub>*</sub>(κ)-LCP Over Symmetric Cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS / 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: 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: On the<i>P<sub>*</sub>(κ)</i>horizontal linear complementarity problems over Cartesian product of symmetric cones / 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: 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 Full-Newton step infeasible-interior-point algorithm for P*(k)-horizontal linear complementarity problems / 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 primal-dual path-following method for convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial interior-point algorithm for monotone linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems / 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: A full Nesterov–Todd step infeasible-interior-point algorithm for Cartesian<i>P</i><sub>*</sub>(κ) horizontal linear complementarity problems over symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear systems in Jordan algebras and primal-dual interior-point algorithms / 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: Similarity and other spectral relations for symmetric cones / 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: On a Class of Superlinearly Convergent Polynomial Time Interior Point Methods for Sufficient LCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A path-following full Newton-step infeasible interior-point algorithm for \(P_*(\kappa)\)-HLCPs based on a kernel function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity analysis of a full-{N}ewton step interior-point method for linear optimization / rank
 
Normal rank

Latest revision as of 14:08, 13 July 2024

scientific article
Language Label Description Also known as
English
An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones
scientific article

    Statements

    An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 March 2017
    0 references
    infeasible interior point method
    0 references
    \(P_\ast(\kappa)\) horizontal linear complementarity problem
    0 references
    Euclidean Jordan algebra
    0 references
    Cartesian product of symmetric cones
    0 references

    Identifiers