Self-Regular Interior-Point Methods for Semidefinite Optimization

DOI10.1007/978-1-4614-0769-0_15zbMath1334.90115OpenAlexW73442435MaRDI QIDQ2802533

Publication date: 26 April 2016

Published in: International Series in Operations Research & Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-0769-0_15

Mathematics Subject Classification ID

Semidefinite programming (90C22) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (2)

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

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
A tight semidefinite relaxation of the MAX CUT problem
A new class of polynomial primal-dual methods for linear and semidefinite optimization
Self-regular functions and new search directions for linear and semidefinite optimization
Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with $O(\sqrt{n}\log\frac{\mathrm{Tr}(X^0S^0)}{\epsilon})$ Iteration Complexity
Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
AN INTERIOR POINT APPROACH FOR SEMIDEFINITE OPTIMIZATION USING NEW PROXIMITY FUNCTIONS
A generic primal–dual interior-point method for semidefinite optimization based on a new class of kernel functions
Kernel-function Based Algorithms for Semidefinite Optimization
Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
Self-Scaled Barriers and Interior-Point Methods for Convex Programming
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
Primal-Dual Interior-Point Methods for Self-Scaled Cones
On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
Semidefinite Programming
An Interior-Point Method for Semidefinite Programming
An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
Handbook of semidefinite programming. Theory, algorithms, and applications

This page was built for publication: Self-Regular Interior-Point Methods for Semidefinite Optimization