Keyword: semidefinite programming

Found 31 papers in total
Finding a strict feasible solution of a linear semidefinite program
Finding a strict feasible solution of a linear semidefinite program
2011,
This study deals with the performance of projective interior point methods for linear...
A full‐NT‐step infeasible interior‐point algorithm for SDP based on kernel functions
A full‐NT‐step infeasible interior‐point algorithm for SDP based on kernel functions
2011,
This paper proposes an infeasible interior‐point algorithm with full...
A sensitivity result for semidefinite programs
A sensitivity result for semidefinite programs
2004,
We study the sensitivity of solutions of linear semidefinite programs under small...
The simplest semidefinite programs are trivial
The simplest semidefinite programs are trivial
1995,
We consider optimization problems of the following type: min (tr(CX): A(X)=B, X...
Semidefinite programming relaxations for semialgebraic problems
Semidefinite programming relaxations for semialgebraic problems
2003,
A hierarchy of convex relaxations for semialgebraic problems is introduced. For...
First- and second-order methods for semidefinite programming
First- and second-order methods for semidefinite programming
2003,
In this paper, we survey the most recent methods that have been developed for the...
Exploiting sparsity in semidefinite programming via matrix completion II: Implementation and numerical results
Exploiting sparsity in semidefinite programming via matrix completion II: Implementation and numerical results
2003,
In Part I of this series of articles, we introduced a general framework of exploiting...
Numerical evaluation of ‘SBmethod’, a version of the Spectral Bundle method, for combinatorial optimization
Numerical evaluation of ‘SBmethod’, a version of the Spectral Bundle method, for combinatorial optimization
2003,
We report numerical results for SBmethod – a publicly available implementation...
Graph partitioning using linear and semidefinite programming
Graph partitioning using linear and semidefinite programming
2003,
Graph partition is used in the telecommunication industry to subdivide a transmission...
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
2003,
In this paper, we present a nonlinear programming algorithm for solving semidefinite...
On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues
On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues
1998,
We derive some basic results on the geometry of semidefinite programming (SDP) and...
Robust control via sequential semidefinite programming
Robust control via sequential semidefinite programming
2002,
This paper discusses nonlinear optimization techniques in robust control synthesis,...
An analytic center cutting plane method for semidefinite feasibility problems
An analytic center cutting plane method for semidefinite feasibility problems
2002,
Semidefinite feasibility problems arise in many areas of operations research. The...
Relationship between strong monotonicity property, P2-property, and the Globally Uniquely Solvable (GUS)-property in semidefinite linear complementarity problems
Relationship between strong monotonicity property, P2-property, and the Globally Uniquely Solvable (GUS)-property in semidefinite linear complementarity problems
2002,
In the recent paper on semidefinite linear complementarity problems, Gowda and Song...
On the finite convergence of successive semidefinite programming relaxation methods
On the finite convergence of successive semidefinite programming relaxation methods
2002,
Let F be a subset of the n -dimensional Euclidean space R n represented in terms of a...
Analyticity of the central path at the boundary point in semidefinite programming
Analyticity of the central path at the boundary point in semidefinite programming
2002,
In this paper we study the limiting behavior of the central path for semidefinite...
An improved rounding method and semidefinite programming relaxation for graph partition
An improved rounding method and semidefinite programming relaxation for graph partition
2002,
Given an undirected graph G = (V, E) with |V| = n and an integer k...
Semidefinite programming
Semidefinite programming
2002,
Due to its many applications in control theory, robust optimization, combinatorial...
Optimality conditions for nonconvex semidefinite programming
Optimality conditions for nonconvex semidefinite programming
2000,
This paper concerns nonlinear semidefinite programming problems for which no convexity...
Projection and contraction methods for semidefinite programming
Projection and contraction methods for semidefinite programming
1998,
Recently, He presented some iterative projection and contraction (PC) methods for...
On the long-step path-following method for semidefinite programming
On the long-step path-following method for semidefinite programming
1998,
It has been shown in various recent research reports that the analysis of short-step...
Method of approximate centers for semi-definite programming
Method of approximate centers for semi-definite programming
1997,
The success of interior point algorithms for large-scale linear programming has...
Monotonicity of primal–dual interior-point algorithms for semidefinite programming problems
Monotonicity of primal–dual interior-point algorithms for semidefinite programming problems
1998,
We present primal–dual interior-point algorithms with polynomial iteration...
Exterior minimum-penalty path-following methods in semidefinite programming
Exterior minimum-penalty path-following methods in semidefinite programming
1999,
A semidefinite programming problem is a mathematical program in which the objective...
Papers per page: