New interior-point algorithm for symmetric optimization based on a positive-asymptotic barrier function

DOI10.1080/01630563.2018.1492938zbMATH Open1407.90251OpenAlexW2897075737MaRDI QIDQ4622797FDOQ4622797

Authors: 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

Recommendations

• Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier
• A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions
• Interior-point methods based on kernel functions for symmetric optimization
• An interior-point method for symmetric optimization based on a new wide neighborhood
• A primal-dual interior-point algorithm for symmetric optimization based on a new kernel function with trigonometric barrier term yielding the best known iteration bounds

zbMATH Keywords

polynomial complexityEuclidean Jordan algebrasymmetric conesymmetric optimizationpositive-asymptotic kernel function

Mathematics Subject Classification ID

Convex programming (90C25) Interior-point methods (90C51)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A new polynomial-time algorithm for linear programming
• Title not available (Why is that?)
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
• Title not available (Why is that?)
• Second-order cone programming
• A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
• Extension of primal-dual interior point algorithms to symmetric cones
• A Jordan-algebraic approach to potential-reduction algorithms
• Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
• Title not available (Why is that?)
• A polynomial path-following interior point algorithm for general linear complementarity problems
• Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
• New interior point algorithms in linear programming
• Similarity and other spectral relations for symmetric cones
• Aspects of semidefinite programming. Interior point algorithms and selected applications
• Title not available (Why is that?)
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• A polynomial interior-point algorithm for monotone linear complementarity problems
• A new primal-dual path-following method for convex quadratic programming
• Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
• Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
• 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
• A new infeasible interior-point method based on Darvay's technique for symmetric optimization
• A new primal-dual path-following interior-point algorithm for semidefinite optimization
• A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems
• Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
• A new algorithm for solving self-dual linear optimization problems

Cited In (8)

• Interior-point methods based on kernel functions for symmetric optimization
• Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier
• Towards non-symmetric conic optimization
• New predictor-corrector algorithm for symmetric cone horizontal linear complementarity problems
• A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions
• Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function
• Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique
• A new corrector-predictor interior-point method for symmetric cone optimization

This page was built for publication: New interior-point algorithm for symmetric optimization based on a positive-asymptotic barrier function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4622797)