Keyword: programming (semidefinite)

Found 45 papers in total
Robust least square semidefinite programming with applications
Robust least square semidefinite programming with applications
2014,
In this paper, we consider a least square semidefinite programming problem under...
Nonsingularity of FB system and constraint nondegeneracy in semidefinite programming
Nonsingularity of FB system and constraint nondegeneracy in semidefinite programming
2013,
For a KKT point of the linear semidefinite programming (SDP), we show that the...
Simplified infeasible interior‐point algorithm for SDO using full Nesterov‐Todd step
Simplified infeasible interior‐point algorithm for SDO using full Nesterov‐Todd step
2012,
Interior‐point methods for semidefinite optimization problems have been studied...
Primal‐dual interior‐point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
Primal‐dual interior‐point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
2012,
In this paper we propose primal‐dual interior‐point algorithms for...
An Exact Duality Theory for Semidefinite Programming Based on Sums of Squares
An Exact Duality Theory for Semidefinite Programming Based on Sums of Squares
2013,
Farkas' lemma is a fundamental result from linear programming providing linear...
New results on semidefinite bounds for l1‐constrained nonconvex quadratic optimization
New results on semidefinite bounds for l1‐constrained nonconvex quadratic optimization
2013,
In this paper, we show that the direct semidefinite programming (SDP) bound for the...
Implementation of a block‐decomposition algorithm for solving large‐scale conic semidefinite programming problems
Implementation of a block‐decomposition algorithm for solving large‐scale conic semidefinite programming problems
2014,
In this paper, we consider block‐decomposition first‐order methods for...
Finding largest small polygons with GloptiPoly
Finding largest small polygons with GloptiPoly
2013,
A small polygon is a convex polygon of unit diameter. We are interested in small...
SDP reformulation for robust optimization problems based on nonconvex QP duality
SDP reformulation for robust optimization problems based on nonconvex QP duality
2013,
In a real situation, optimization problems often involve uncertain parameters. Robust...
Semidefinite relaxations for partitioning, assignment and ordering problems
Semidefinite relaxations for partitioning, assignment and ordering problems
2012,
Semidefinite optimization is a strong tool in the study of NP‐hard...
Strange behaviors of interior‐point methods for solving semidefinite programming problems in polynomial optimization
Strange behaviors of interior‐point methods for solving semidefinite programming problems in polynomial optimization
2012,
We observe that in a simple one‐dimensional polynomial optimization problem...
Rate of Convergence Analysis of Discretization and Smoothing Algorithms for Semiinfinite Minimax Problems
Rate of Convergence Analysis of Discretization and Smoothing Algorithms for Semiinfinite Minimax Problems
2012,
Discretization algorithms for semiinfinite minimax problems replace the original...
Homogeneous Self‐dual Algorithms for Stochastic Semidefinite Programming
Homogeneous Self‐dual Algorithms for Stochastic Semidefinite Programming
2012,
Ariyawansa and Zhu have proposed a new class of optimization problems termed...
A ‘joint + marginal’ heuristic for 0/1 programs
A ‘joint + marginal’ heuristic for 0/1 programs
2012,
We propose a heuristic for 0/1 programs based on the recent ‘joint +...
How to generate weakly infeasible semidefinite programs via Lasserre’s relaxations for polynomial optimization
How to generate weakly infeasible semidefinite programs via Lasserre’s relaxations for polynomial optimization
2012,
Examples of weakly infeasible semidefinite programs (SDP) are useful to test whether...
A new second‐order corrector interior‐point algorithm for semidefinite programming
A new second‐order corrector interior‐point algorithm for semidefinite programming
2012,
In this paper, we propose a second‐order corrector interior‐point...
On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming
On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming
2012,
In this paper, we present new convergence properties of the augmented Lagrangian...
The Q Method for Symmetric Cone Programming
The Q Method for Symmetric Cone Programming
2011,
The Q method of semidefinite programming, developed by Alizadeh, Haeberly and Overton,...
Semidefinite complementarity reformulation for robust Nash equilibrium problems with Euclidean uncertainty sets
Semidefinite complementarity reformulation for robust Nash equilibrium problems with Euclidean uncertainty sets
2012,
Consider the N ‐person non‐cooperative game in which each player’s...
A unified kernel function approach to primal‐dual interior‐point algorithms for convex quadratic SDO (semidefinite optimization)
A unified kernel function approach to primal‐dual interior‐point algorithms for convex quadratic SDO (semidefinite optimization)
2011,
Kernel functions play an important role in the design and analysis of...
On Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming
On Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming
2011,
We analyze two popular semidefinite programming relaxations for quadratically...
Semidefinite relaxation bounds for bi‐quadratic optimization problems with quadratic constraints
Semidefinite relaxation bounds for bi‐quadratic optimization problems with quadratic constraints
2011,
This paper studies the relationship between the so‐called bi‐quadratic...
Models for minimax stochastic linear optimization problems with risk aversion
Models for minimax stochastic linear optimization problems with risk aversion
2010,
We propose a semidefinite optimization (SDP) model for the class of minimax two-stage...
Semi-definite programming techniques for structured quadratic inverse eigenvalue problems
Semi-definite programming techniques for structured quadratic inverse eigenvalue problems
2010,
In the past decade or so, semi-definite programming (SDP) has emerged as a powerful...
Papers per page: