A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS
From MaRDI portal
Publication:2911579
DOI10.1142/S0217595912500157zbMath1247.90272MaRDI QIDQ2911579
Publication date: 31 August 2012
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
iteration boundinterior-point algorithmEuclidean Jordan algebrasymmetric cone linear complementarity problemsmall-update method
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items (13)
Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation ⋮ Complexity analysis of a full-{N}ewton step interior-point method for linear optimization ⋮ A corrector-predictor interior-point method with new search direction for linear optimization ⋮ An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones ⋮ Unnamed Item ⋮ New Interior-Point Algorithm for Symmetric Optimization Based on a Positive-Asymptotic Barrier Function ⋮ A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function ⋮ A large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones ⋮ A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions ⋮ New method for determining search directions for interior-point algorithms in linear optimization ⋮ Unnamed Item ⋮ A full Nesterov-Todd step feasible weighted primal-dual interior-point algorithm for symmetric optimization ⋮ A projection and contraction method for symmetric cone complementarity problem
Cites Work
- Unnamed Item
- Unnamed Item
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
- Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem
- Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
- A new primal-dual path-following interior-point algorithm for semidefinite optimization
- Convergence of a smoothing algorithm for symmetric cone complementarity problems with a nonmonotone line search
- An \(O(rL)\) infeasible interior-point algorithm for symmetric cone LCP via CHKS function
- Euclidean Jordan algebras and interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- On a commutative class of search directions for linear programming over symmetric cones
- Self-regular functions and new search directions for linear and semidefinite optimization
- Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
- Smoothing Functions for Second-Order-Cone Complementarity Problems
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- AN INTERIOR POINT APPROACH FOR SEMIDEFINITE OPTIMIZATION USING NEW PROXIMITY FUNCTIONS
- A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems
- SOME PROPERTIES OF A CLASS OF MERIT FUNCTIONS FOR SYMMETRIC CONE COMPLEMENTARITY PROBLEMS
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Interior Point Algorithms For Linear Complementarity Problems Based On Large Neighborhoods Of The Central Path
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities
- A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems
- Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones
- 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 NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS
