Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
From MaRDI portal
Publication:1012072
DOI10.1016/j.na.2008.07.016zbMath1190.90275OpenAlexW2082117585MaRDI QIDQ1012072
Guo-Qiang Wang, Cornelis Roos, Yan-Qin Bai
Publication date: 14 April 2009
Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.na.2008.07.016
primal-dual methodinterior-point methodspolynomial complexitylarge- and small-update methodssecond-order cone optimization
Related Items
A primal–dual predictor–corrector interior-point method for symmetric cone programming with O(√r log ϵ−1) iteration complexity, A full-step interior-point algorithm for second-order cone optimization based on a simple locally kernel function, A wide neighbourhood predictor–corrector infeasible-interior-point algorithm for symmetric cone programming, A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS, A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization, A modified and simplified full Nesterov-Todd step \(\mathcal {O}(N)\) infeasible interior-point method for second-order cone optimization, Two wide neighborhood interior-point methods for symmetric cone optimization, Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone, A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization, A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem, Complexity analysis of an interior-point algorithm for linear optimization based on a new parametric kernel function with a double barrier term, Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions, A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods, A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization, A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO, A full-Newton step interior-point algorithm for linear optimization based on a finite barrier, A smoothing Newton method for second-order cone optimization based on a new smoothing function, Primal–dual interior-point method for linear optimization based on a kernel function with trigonometric growth term, Two new predictor-corrector algorithms for second-order cone programming, Complexity analysis of an interior point algorithm for the semidefinite optimization based on a kernel function with a double barrier term, A new one-step smoothing Newton method for second-order cone programming., Conditions for error bounds of linear complementarity problems over second-order cones with pseudomonotonicity, An interior-point algorithm for linear optimization based on a new barrier function, A one-parametric class of smoothing functions for second-order cone programming, A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step, A polynomial-time interior-point method for circular cone programming based on kernel functions, A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function, A predictor-corrector infeasible-interior-point method for the Cartesian -LCP over symmetric cones with iteration complexity, Primal-dual interior-point algorithms for convex quadratic circular cone optimization
Uses Software
Cites Work
- 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
- Self-regular functions and new search directions for linear and semidefinite optimization
- A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms
- 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
- Smoothing Functions for Second-Order-Cone Complementarity Problems
- Some continuity properties of polyhedral multifunctions
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Implementation of interior point methods for mixed semidefinite and second order cone optimization problems
- A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Conic convex programming and self-dual embedding
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- Handbook of semidefinite programming. Theory, algorithms, and applications
- New complexity analysis of the primal-dual Newton method for linear optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
