Primal-dual interior-point algorithms for second-order cone optimization based on a new parametric kernel function
From MaRDI portal
Publication:2477797
DOI10.1007/S10114-007-0967-ZzbMath1169.90483OpenAlexW2072299359MaRDI QIDQ2477797
Publication date: 14 March 2008
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-007-0967-z
interior-point methodslinear optimizationpolynomial-time complexitylarge- and small-update methodssecond-order cone optimization
Related Items (13)
A full-step interior-point algorithm for second-order cone optimization based on a simple locally kernel function ⋮ Global and local convergence of a new affine scaling trust region algorithm for linearly constrained optimization ⋮ New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems ⋮ A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods ⋮ Some useful inequalities via trace function method in Euclidean Jordan algebras ⋮ A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms ⋮ A \({\mathcal {VU}}\)-decomposition method for a second-order cone programming problem ⋮ A Polynomial-time Interior-point Algorithm for Convex Quadratic Semidefinite Optimization ⋮ Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem ⋮ Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function ⋮ A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step ⋮ A new primal-dual path-following interior-point algorithm for semidefinite optimization ⋮ A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems
Cites Work
- Unnamed Item
- Unnamed Item
- Applications of second-order cone programming
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- On implementing a primal-dual interior-point method for conic quadratic optimization
- Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions
- Approximate augmented Lagrangian functions and nonlinear semidefinite programs
- Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
- Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming
- A polynomial-time algorithm for linear optimization based on a new simple kernel function
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
This page was built for publication: Primal-dual interior-point algorithms for second-order cone optimization based on a new parametric kernel function
