New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems
DOI10.1186/1687-1812-2012-213zbMATH Open1277.90147OpenAlexW2130577595WikidataQ59271853 ScholiaQ59271853MaRDI QIDQ383382FDOQ383382
Authors: Bo Kyung Choi, Gue Myung Lee 
Publication date: 4 December 2013
Published in: Fixed Point Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/1687-1812-2012-213
Recommendations
- On complexity analysis of the primal-dual interior-point method for second-order cone optimization problem
- Primal-dual interior point algorithms for semidefinite optimization based on a kernel function with quadratic growth rate
- Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
- Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function
- Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization
Euclidean Jordan algebrakernel functioncomplexity analysisprimal-dual interior-point methodsproximity functionself-scaled optimization problemworst-case iteration bound
Numerical mathematical programming methods (65K05) Convex programming (90C25) Interior-point methods (90C51)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Self-regular functions and new search directions for linear and semidefinite optimization
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- A mathematical view of interior-point methods in convex optimization
- Some P-properties for linear transformations on Euclidean Jordan algebras
- Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras
- 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
- Applications of geometric means on symmetric cones
- A Jordan-algebraic approach to potential-reduction algorithms
- On a commutative class of search directions for linear programming over symmetric cones
- Title not available (Why is that?)
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Interior-point methods based on kernel functions for symmetric optimization
- Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras
- A long-step primal--dual algorithm for the symmetric programming problem
- Primal-dual interior-point algorithms for second-order cone optimization based on a new parametric kernel function
- Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
- On complexity analysis of the primal-dual interior-point method for second-order cone optimization problem
- New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems
- On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (3)
- Linear fractional optimization problems on Jordan Euclidean algebras
- New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems
- On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function
This page was built for publication: New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q383382)
