A full Nesterov-Todd step feasible weighted primal-dual interior-point algorithm for symmetric optimization

DOI10.1007/s40305-013-0032-9zbMath1296.90137OpenAlexW2013310074MaRDI QIDQ743780

Behrouz Kheirfam

Publication date: 30 September 2014

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-013-0032-9

zbMATH Keywords

polynomial complexityfull Nesterov-Todd stepsymmetric cone optimizationtarget-following

Mathematics Subject Classification ID

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

Related Items

A weighted-path-following method for symmetric cone linear complementarity problems, A power penalty method for second-order cone nonlinear complementarity problems

Cites Work

• A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
• A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization
• A new primal-dual path-following interior-point algorithm for semidefinite optimization
• Linear systems in Jordan algebras and primal-dual interior-point algorithms
• Euclidean Jordan algebras and interior-point algorithms
• Extension of primal-dual interior point algorithms to symmetric cones
• Similarity and other spectral relations for symmetric cones
• Primal-dual target-following algorithms for linear programming
• A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
• A new infeasible interior-point method based on Darvay's technique for symmetric optimization
• Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones
• A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS
• A Weighted-Path-Following Method for Monotone Horizontal Linear Complementarity Problem
• Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
• A Polynomial Method of Weighted Centers for Convex Quadratic Programming
• 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
• Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
• A Jordan-algebraic approach to potential-reduction algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item