Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function

DOI10.1080/10556788.2020.1734803zbMath1501.90110OpenAlexW3012036848MaRDI QIDQ5038177

Soodabeh Asadi, Nezam Mahdavi-Amiri, Zsolt Darvay, Petra Renáta Rigó

Publication date: 29 September 2022

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2020.1734803

zbMATH Keywords

Euclidean Jordan algebraNesterov-Todd directionsalgebraic transformation of the central pathCartesian symmetric cone horizontal linear complementarity problempositive-asymptotic barrier function

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)

Related Items (2)

Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations ⋮ 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
• Unnamed Item
• A path-following full Newton-step infeasible interior-point algorithm for \(P_*(\kappa)\)-HLCPs based on a kernel function
• A polynomial interior-point algorithm for monotone linear complementarity problems
• A new primal-dual path-following method for convex quadratic programming
• Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones
• A new polynomial-time algorithm for linear programming
• Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation
• A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization
• A polynomial path-following interior point algorithm for general linear complementarity problems
• A polynomial-time algorithm for a class of linear complementarity problems
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• Linear systems in Jordan algebras and primal-dual interior-point algorithms
• Extension of primal-dual interior point algorithms to symmetric cones
• Similarity and other spectral relations for symmetric cones
• Pivot versus interior point methods: Pros and cons
• Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier
• Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
• Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones
• A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
• Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
• An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation
• An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function
• A full Nesterov–Todd step infeasible-interior-point algorithm for CartesianP_*(κ) horizontal linear complementarity problems over 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 Corrector-Predictor Interior-Point Algorithm for P_∗(κ)-HLCPs Over Cartesian Product of Symmetric Cones
• On the Implementation of a Primal-Dual Interior Point Method
• On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
• An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
• Barrier Functions in Interior Point Methods
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• Conic convex programming and self-dual embedding
• New Interior-Point Algorithm for Symmetric Optimization Based on a Positive-Asymptotic Barrier Function
• A long-step interior-point algorithm for symmetric cone Cartesian P_*(κ)-HLCP
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• The theory of linear programming:skew symmetric self-dual problems and the central path^*
• Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction
• Interior-point methods for CartesianP_*(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions
• A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
• Corrector‐Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path
• A Jordan-algebraic approach to potential-reduction algorithms

This page was built for publication: Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function