Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function

DOI10.1007/S10852-005-3561-3MaRDI QIDQ2583508zbMATH OpenOpenAlexFDO

Authors C. Roos, Guoqiang Wang, Yanqin Bai

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

zbMATH Keywords

interior-point methodspolynomial complexitysemidefinite optimizationprimal-dual methodslarge- and small-update methods

Mathematics Subject Classification ID

Interior-point methods (90C51) Semidefinite programming (90C22) Sensitivity, stability, parametric optimization (90C31)

Recommendations

• Primal-dual interior point algorithms for semidefinite optimization based on a kernel function with quadratic growth rate
• Kernel function based interior-point algorithms for semidefinite optimization
• Numerical results of primal-dual interior-point algorithms for semidefinite optimization based on kernel functions
• Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization
• A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function

Cites work

• scientific article; zbMATH DE number 194139 (Why is no real title available?)
• scientific article; zbMATH DE number 741122 (Why is no real title available?)
• scientific article; zbMATH DE number 1017028 (Why is no real title available?)
• scientific article; zbMATH DE number 1047679 (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
• An Interior-Point Method for Semidefinite Programming
• Handbook of semidefinite programming. Theory, algorithms, and applications
• Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
• Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
• Primal--Dual Path-Following Algorithms for Semidefinite Programming
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• Self-regular functions and new search directions for linear and semidefinite optimization

Cited in

(49)

• A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO
• Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
• Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
• Complexity analysis of an interior-point algorithm for linear optimization based on a new parametric kernel function with a double barrier term
• A new primal-dual path-following interior-point algorithm for semidefinite optimization
• Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step
• Primal-dual interior-point algorithm for convex quadratic semi-definite optimization
• Primal-dual interior-point algorithms for second-order cone optimization based on a new parametric kernel function
• On extending primal-dual interior-point method for linear optimization to convex quadratic symmetric cone optimization
• A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions
• A modified infeasible interior-point algorithm with full-Newton step for semidefinite optimization
• Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems
• Interior-point algorithms for LO and SDO based on a new class of kernel functions
• A wide neighbourhood primal-dual second-order corrector interior point algorithm for semidefinite optimization
• A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function
• A new polynomial interior-point algorithm for the monotone linear complementarity problem over symmetric cones with full NT-steps
• A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
• A corrector-predictor path-following algorithm for semidefinite optimization
• Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization
• Complexity analysis of an interior point algorithm for the semidefinite optimization based on a kernel function with a double barrier term
• A polynomial-time interior-point algorithm for convex quadratic semidefinite optimization
• A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function
• Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term
• An efficient parameterized logarithmic kernel function for semidefinite optimization
• A generic primal-dual interior-point method for semidefinite optimization based on a new class of kernel functions
• scientific article; zbMATH DE number 6178879 (Why is no real title available?)
• A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
• Interior-point algorithm for SDO based on new classes of kernel functions
• Numerical results of primal-dual interior-point algorithms for semidefinite optimization based on kernel functions
• Simplified full Nesterov-Todd step infeasible interior-point algorithm for semidefinite optimization based on a kernel function
• A new primal-dual interior-point algorithm for solving semidefinite optimization
• A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION
• A full NT-step infeasible interior-point algorithm for semidefinite optimization based on a self-regular proximity
• scientific article; zbMATH DE number 6472516 (Why is no real title available?)
• Kernel-function Based Algorithms for Semidefinite Optimization
• A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions
• Self-regular interior-point methods for semidefinite optimization
• Kernel function based interior-point algorithms for semidefinite optimization
• Primal-dual interior point methods for Semidefinite programming based on a new type of kernel functions
• scientific article; zbMATH DE number 6515403 (Why is no real title available?)
• Primal-dual interior point algorithms for semidefinite optimization based on a kernel function with quadratic growth rate
• A class of polynomial primal-dual interior-point algorithms for semidefinite optimization
• Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone
• An efficient hyperbolic kernel function yielding the best known iteration bounds for linear programming
• New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems
• AN INTERIOR POINT APPROACH FOR SEMIDEFINITE OPTIMIZATION USING NEW PROXIMITY FUNCTIONS
• A full-Newton step infeasible interior point algorithm and its parameters analysis
• 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

This page was built for publication: Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583508)