Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
From MaRDI portal
Publication:2583508
DOI10.1007/s10852-005-3561-3zbMath1111.90083OpenAlexW2127057002MaRDI QIDQ2583508
Cornelis Roos, Yan-Qin Bai, Guo-Qiang Wang
Publication date: 17 January 2006
Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10852-005-3561-3
interior-point methodssemidefinite optimizationpolynomial complexityprimal-dual methodslarge- and small-update methods
Semidefinite programming (90C22) Sensitivity, stability, parametric optimization (90C31) Interior-point methods (90C51)
Related Items
A modified infeasible interior-point algorithm with full-Newton step for semidefinite optimization, A FULL NT-STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR SEMIDEFINITE OPTIMIZATION BASED ON A SELF-REGULAR PROXIMITY, A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS, A corrector–predictor path-following algorithm for semidefinite optimization, Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization, Primal-dual interior point methods for Semidefinite programming based on a new type of kernel functions, Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone, New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems, A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function, Complexity analysis of an interior-point algorithm for linear optimization based on a new parametric kernel function with a double barrier term, Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step, A wide neighbourhood primal-dual second-order corrector interior point algorithm for semidefinite 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 novel neural network for solving semidefinite programming problems with some applications, Primal-dual interior-point algorithm for convex quadratic semi-definite optimization, A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions, Primal-dual interior-point algorithms for second-order cone optimization based on a new parametric kernel function, Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term, An efficient parameterized logarithmic kernel function for semidefinite optimization, A Polynomial-time Interior-point Algorithm for Convex Quadratic Semidefinite Optimization, A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions, Self-Regular Interior-Point Methods for Semidefinite Optimization, A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step, A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization, Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions, A new primal-dual path-following interior-point algorithm for semidefinite optimization, Kernel-function Based Algorithms for Semidefinite Optimization, AN INTERIOR POINT APPROACH FOR SEMIDEFINITE OPTIMIZATION USING NEW PROXIMITY FUNCTIONS, Simplified full Nesterov-Todd step infeasible interior-point algorithm for semidefinite optimization based on a kernel function, Research Article: On Extending Primal-Dual Interior-Point Method for Linear Optimization to Convex Quadratic Symmetric Cone Optimization, A class of polynomial primal-dual interior-point algorithms for semidefinite optimization, Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term, Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Self-regular functions and new search directions for linear and semidefinite optimization
- Lectures on Modern Convex Optimization
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- An Interior-Point Method for Semidefinite Programming
- Handbook of semidefinite programming. Theory, algorithms, and applications