A long-step interior-point algorithm for symmetric cone Cartesian P*(κ)-HLCP
From MaRDI portal
Publication:4646542
DOI10.1080/02331934.2018.1512604zbMath1416.90049OpenAlexW2888989731MaRDI QIDQ4646542
No author found.
Publication date: 14 January 2019
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2018.1512604
interior-point methodEuclidean Jordan algebraCartesian product of symmetric cones\(P_\ast (\kappa)\) horizontal linear complementarity problem
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items (4)
Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function ⋮ Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations ⋮ A Mehrotra type predictor-corrector interior-point algorithm for linear programming ⋮ Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
- Corrector-predictor methods for sufficient linear complementarity problems
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization
- Primal-dual interior-point algorithm for convex quadratic semi-definite optimization
- Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
- An infeasible-interior-point predictor-corrector algorithm for the \(P_ *\)-geometric LCP
- Euclidean Jordan algebras and interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- Polynomiality of primal-dual algorithms for semidefinite linear complementarity problems based on the Kojima-Shindoh-Hara family of directions
- A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with \(O(\sqrt nL)\)-iteration complexity
- \(P_ *\)-matrices are just sufficient
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization
- A Mathematical View of Interior-Point Methods in Convex Optimization
- On theP*(κ)horizontal linear complementarity problems over Cartesian product of symmetric cones
- 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
- Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems
- A method for weighted projections to the positive definite cone
- Barrier Functions in Interior Point Methods
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Equivaence between different formulations of the linear complementarity promblem
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Extension of primal-dual interior point methods to diff-convex problems on symmetric cones
- Infeasible Mehrotra-Type Predictor-Corrector Interior-Point Algorithm for the CartesianP*(κ)-LCP Over Symmetric Cones
- Interior-point methods for CartesianP*(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions
- Full Nesterov–Todd step feasible interior-point method for the CartesianP*(κ)-SCLCP
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
- A Jordan-algebraic approach to potential-reduction algorithms
This page was built for publication: A long-step interior-point algorithm for symmetric cone Cartesian P*(κ)-HLCP
