Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones
Publication:1730771
DOI10.1007/s10957-018-1402-6zbMath1409.90198OpenAlexW2896984205WikidataQ129086396 ScholiaQ129086396MaRDI QIDQ1730771
Maryam Zangiabadi, Zsolt Darvay, Nezam Mahdavi-Amiri, Soodabeh Asadi, Hossein Mansouri
Publication date: 6 March 2019
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-018-1402-6
horizontal linear complementarity probleminfeasible interior-point methodlarge neighborhoodCartesian product of symmetric conesEuclidean Jordan algebra (EJA)
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items (5)
Uses Software
Cites Work
- Unnamed Item
- A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones
- A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
- 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
- Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
- Euclidean Jordan algebras and interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones
- On theP*(κ)horizontal linear complementarity problems over Cartesian product of symmetric cones
- An infeasible full-NT step IPM for horizontal linear complementarity problem 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
- On a Class of Superlinearly Convergent Polynomial Time Interior Point Methods for Sufficient LCP
- Equivalence of LCP and PLS
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- Barrier Functions in Interior Point Methods
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
- Engineering and Economic Applications of Complementarity Problems
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- 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
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
This page was built for publication: Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones
