Self-regular interior-point methods for semidefinite optimization
From MaRDI portal
Publication:2802533
Recommendations
- Primal-dual interior point algorithms for semidefinite optimization based on a kernel function with quadratic growth rate
- Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
- Kernel function based interior-point algorithms for semidefinite optimization
- Self-regular functions and new search directions for linear and semidefinite optimization
- Numerical results of primal-dual interior-point algorithms for semidefinite optimization based on kernel functions
Cites work
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1862745 (Why is no real title available?)
- scientific article; zbMATH DE number 3239575 (Why is no real title available?)
- A generic primal-dual interior-point method for semidefinite optimization based on a new class of kernel functions
- A new class of large neighborhood path-following interior point algorithms for semidefinite optimization with \(O(\sqrt{n}\log\frac{\text{Tr}(X^0S^0)}{\varepsilon})\) iteration complexity
- A new class of polynomial primal-dual methods for linear and semidefinite optimization
- A tight semidefinite relaxation of the MAX CUT problem
- AN INTERIOR POINT APPROACH FOR SEMIDEFINITE OPTIMIZATION USING NEW PROXIMITY FUNCTIONS
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
- An Interior-Point Method for Semidefinite Programming
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Kernel-function Based Algorithms for Semidefinite Optimization
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Self-regular functions and new search directions for linear and semidefinite optimization
- Semidefinite Programming
Cited in
(5)- Regularized optimization methods with finite-step interior algorithms
- Self-regular functions and new search directions for linear and semidefinite optimization
- scientific article; zbMATH DE number 6472516 (Why is no real title available?)
- Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier
- A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions
This page was built for publication: Self-regular interior-point methods for semidefinite optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802533)
