New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems
From MaRDI portal
(Redirected from Publication:383382)
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
Cites work
- scientific article; zbMATH DE number 194139 (Why is no real title available?)
- scientific article; zbMATH DE number 715155 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1047679 (Why is no real title available?)
- scientific article; zbMATH DE number 1534294 (Why is no real title available?)
- scientific article; zbMATH DE number 1534295 (Why is no real title available?)
- scientific article; zbMATH DE number 1862745 (Why is no real title available?)
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- A Jordan-algebraic approach to potential-reduction algorithms
- A long-step primal--dual algorithm for the symmetric programming problem
- A mathematical view of interior-point methods in convex optimization
- Applications of geometric means on symmetric cones
- Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras
- Euclidean Jordan algebras and interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- Interior-point methods based on kernel functions for symmetric optimization
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras
- New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems
- On a commutative class of search directions for linear programming over symmetric cones
- On complexity analysis of the primal-dual interior-point method for second-order cone optimization problem
- On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function
- Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- 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
- Self-regular functions and new search directions for linear and semidefinite optimization
- Some P-properties for linear transformations on Euclidean Jordan algebras
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)
