A long-step interior-point algorithm for symmetric cone Cartesian <i>P</i><sub>*</sub>(κ)-HLCP (Q4646542): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/02331934.2018.1512604 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2888989731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / 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: Barrier Functions in Interior Point Methods / 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: 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: Full Nesterov-Todd step infeasible interior-point method for symmetric optimization / 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 Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization / 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: Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones / 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: 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: Primal-dual interior-point algorithm for convex quadratic semi-definite optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-Dimensional Variational Inequalities and Complementarity Problems / 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: Equivaence between different formulations of the linear complementarity promblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infeasible-interior-point predictor-corrector algorithm for the \(P_ *\)-geometric LCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(P_ *\)-matrices are just sufficient / 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: 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 Mathematical View of Interior-Point Methods in Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4791754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems / 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: 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: A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4321748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomiality of primal-dual algorithms for semidefinite linear complementarity problems based on the Kojima-Shindoh-Hara family of directions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for weighted projections to the positive definite cone / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension of primal-dual interior point methods to diff-convex problems on symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrector-predictor methods for sufficient linear complementarity problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:17, 17 July 2024

scientific article; zbMATH DE number 7001095
Language Label Description Also known as
English
A long-step interior-point algorithm for symmetric cone Cartesian <i>P</i><sub>*</sub>(κ)-HLCP
scientific article; zbMATH DE number 7001095

    Statements

    A long-step interior-point algorithm for symmetric cone Cartesian <i>P</i><sub>*</sub>(κ)-HLCP (English)
    0 references
    0 references
    14 January 2019
    0 references
    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
    0 references
    0 references
    0 references
    0 references

    Identifiers