New Interior-Point Algorithm for Symmetric Optimization Based on a Positive-Asymptotic Barrier Function
From MaRDI portal
Publication:4622797
DOI10.1080/01630563.2018.1492938zbMath1407.90251OpenAlexW2897075737MaRDI QIDQ4622797
Zsolt Darvay, Petra Renáta Rigó
Publication date: 18 February 2019
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630563.2018.1492938
polynomial complexitysymmetric coneEuclidean Jordan algebrasymmetric optimizationpositive-asymptotic kernel function
Related Items
Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function, A new corrector-predictor interior-point method for symmetric cone optimization, Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A polynomial interior-point algorithm for monotone linear complementarity problems
- A new primal-dual path-following method for convex quadratic programming
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
- A new polynomial-time algorithm for linear programming
- A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems
- Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
- A polynomial path-following interior point algorithm for general linear complementarity problems
- A new primal-dual path-following interior-point algorithm for semidefinite optimization
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
- Extension of primal-dual interior point algorithms to symmetric cones
- Second-order cone programming
- Similarity and other spectral relations for symmetric cones
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
- Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
- A new infeasible interior-point method based on Darvay's technique for symmetric optimization
- A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS
- A predictor-corrector path-following algorithm for symmetric optimization based on Darvay's technique
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- A Jordan-algebraic approach to potential-reduction algorithms
