• Corpus ID: 16720847

A New Primal-Dual Interior-Point Method for Semidefinite Programming

@inproceedings{Alizadeh1994ANP,
  title={A New Primal-Dual Interior-Point Method for Semidefinite Programming},
  author={Farid Alizadeh and Jean Pierre Haeberly and Michael L. Overton},
  year={1994}
}
The semidefinite programming problem (SDP) is: min tr CX s.t. tr A{sub i}X = b{sub i}, i = 1, {hor_ellipsis}, m, and X {>=} 0. Here C and A{sub i} are fixed symmetric matrices and X {>=} 0 is a semidefinite constraint on the unknown symmetric matrix variable X. The dual of SDP is: max b{sup T} y s.t. Z + {Sigma}{sub i=1}{sup m} y{sub i}A{sub i} = C and Z {>=} 0. Interior point methods for SDP have been developed by Nesterov and Nemirovskii, Alizadeh, Vandenberghe and Boyd, and others. Primal… 
Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
TLDR
The XZ+ZX method is more robust with respect to its ability to step close to the boundary, converges more rapidly, and achieves higher accuracy than other methods considered, including Mehrotra predictor-corrector variants and issues of numerical stability.
Primal-Dual Interior-Point Algorithms for Semidefinite Optimization Based on a Simple Kernel Function
TLDR
This paper presents a primal-dual interior-point algorithm for SDO problems based on a simple kernel function which was first presented at the Proceedings of Industrial Symposium and Optimization Day, Australia, November 2002; the function is not self-regular.
Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities
TLDR
Based on the so-called self-regular proximity functions, new primal-dual Newton methods for solving SOCO problems are proposed and it will be shown that these new large-update IPMs for SOCO enjoy polynomial iteration bounds analogous to those of their LO and SDO cousins.
A Primitive Interior Point Algorithm for Semidefinite Programs in
TLDR
The aim of this working paper is to present a simple and basic version of Kojima, Shindoh and Hara's primal-dual interior-point algorithm for SDPs together with a computer program of the algorithm in Mathematica, placing the emphasis on easy understanding of the fundamental idea of the algorithms without going into its theoretical details.
Semidefinite programming for assignment and partitioning problems
TLDR
An efficient "partial infeasible" primal-dual interior-point algorithm is developed by using a conjugate gradient method and by taking advantage of the special data structure of the SDP relaxation, which plays a significant role in simplifying the problem.
An Interior Point Method for Semidefinite Programming and Max-Cut Bounds
TLDR
The eigenvalue upper bound based on the maximal eigen value of the Laplacian of the graph with the polyhedral upper bound delivered by triangle inequalities is combined and the bounds show considerable improvements to previous results on complete graphs.
A Simplified / Improved HKM Direction for Certain Classes of Semidefinite Programming
Semidefinite Programming (SDP) provides strong bounds for many NP-hard combinatorial problems. Arguably the most popular/efficient search direction for solving SDPs using a primal-dual interior point
Semidefinite Programming Relaxations for the Quadratic Assignment Problem
TLDR
These new relaxations, and their duals, satisfy the Slater constraint qualification, and so can be solved numerically using primal-dual interior-point methods.
A Short Course on Semidefinite Programming ( in order of appearance )
Convex Program general abstract convex program is (CP ) μ := inf f(x) subject to G(x) L 0 x K 0, f : X → real valued convex function on K; X,Y Banach spaces; x K y partial order induced convex cone
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 15 REFERENCES
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
TLDR
It is argued that many known interior point methods for linear programs can be transformed in a mechanical way to algorithms for SDP with proofs of convergence and polynomial time complexity carrying over in a similar fashion.
Symmetric indefinite systems for interior point methods
TLDR
This methodology affords two advantages: it avoids the fill created by explicitly forming the productAD2AT when A has dense columns and it can easily be used to solve nonseparable quadratic programs since it requires only that D be symmetric.
Max-min eigenvalue problems, primal-dual Interior point algorithms, and Trust region subproblemst
Two Primal-dual interior point algorithms are presented for the problem of maximizing the smallest eigenvalue of a symmetric matrix over diagonal perturbations. These algorithms prove to be simple,
A primal—dual potential reduction method for problems involving matrix inequalities
TLDR
The method is based on the theory developed by Nesterov and Nemirovsky and generalizes Gonzaga and Todd's method for linear programming and proves an overallworst-case operation count of O(m5.5L1.5).
On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming Algorithms
TLDR
The surprising result that Q-superlinear convergence can still be attained even if centering is not phased out, provided the iterates asymptotically approach the central path is given.
On the Implementation of a Primal-Dual Interior Point Method
TLDR
A Taylor polynomial of second order is used to approximate a primal-dual trajectory and an adaptive heuristic for estimating the centering parameter is given, which treats primal and dual problems symmetrically.
A primal-dual interior-point method for linear programming based on a weighted barrier function
One motivation for the standard primal-dual direction used in interior-point methods is that it can be obtained by solving a least-squares problem. In this paper, we propose a primal-dual
Interior-point polynomial algorithms in convex programming
TLDR
This book describes the first unified theory of polynomial-time interior-point methods, and describes several of the new algorithms described, e.g., the projective method, which have been implemented, tested on "real world" problems, and found to be extremely efficient in practice.
Second Derivatives for Optimizing Eigenvalues of Symmetric Matrices
TLDR
The main idea is to minimize the maximum eigen value subject to a constraint that this eigenvalue has a certain multiplicity, and the manifold $\Omega$ of matrices with such multiple eigenvalues is parameterized using a matrix exponential representation, leading to the definition of an appropriate Lagrangian function.
Feature Article - Interior Point Methods for Linear Programming: Computational State of the Art
A survey of the significant developments in the field of interior point methods for linear programming is presented, beginning with Karmarkar's projective algorithm and concentrating on the many
...
1
2
...