Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
From MaRDI portal
Publication:2583508
DOI10.1007/S10852-005-3561-3zbMATH Open1111.90083OpenAlexW2127057002MaRDI QIDQ2583508FDOQ2583508
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
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
interior-point methodspolynomial complexitysemidefinite optimizationprimal-dual methodslarge- and small-update methods
Interior-point methods (90C51) Semidefinite programming (90C22) Sensitivity, stability, parametric optimization (90C31)
Cites Work
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Self-regular functions and new search directions for linear and semidefinite optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- Title not available (Why is that?)
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- 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
- Title not available (Why is that?)
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Title not available (Why is that?)
Cited In (49)
- A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO
- Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
- Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric 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 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
- Primal-dual interior-point algorithm for convex quadratic semi-definite 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
- 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
- Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems
- 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
- Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization
- A corrector-predictor path-following algorithm for semidefinite optimization
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
- A polynomial-time interior-point algorithm for convex quadratic semidefinite optimization
- Complexity analysis of an interior point algorithm for the semidefinite optimization based on a kernel function with a double barrier term
- 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
- Title not available (Why is that?)
- 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
- A new primal-dual interior-point algorithm for solving semidefinite optimization
- Simplified full Nesterov-Todd step infeasible interior-point algorithm for semidefinite optimization based on a kernel function
- 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
- Title not available (Why is that?)
- 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
- Primal-dual interior point algorithms for semidefinite optimization based on a kernel function with quadratic growth rate
- Title not available (Why is that?)
- 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
- AN INTERIOR POINT APPROACH FOR SEMIDEFINITE OPTIMIZATION USING NEW PROXIMITY FUNCTIONS
- New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems
- 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
- Complexity analysis of an interior-point algorithm for linear optimization based on a new parametric kernel function with a double barrier term
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)
