Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Keyword: programming (semidefinite)
Found
45 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Some applications of semidefinite optimization from an operations research viewpoint
2009,
Tuncel Levent
No abstract.
Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems
2009,
Grippo Luigi
In this paper we consider the standard linear SDP problem, and its low rank nonlinear...
A new full-Newton step O(n) infeasible interior-point algorithm for semidefinite optimization
2009,
Roos C
Interior-point methods for semidefinite optimization have been studied intensively,...
Exploiting group symmetry in truss topology optimization
2009,
Bai Yanqin
We consider semidefinite programming (SDP) formulations of certain truss topology...
Kernel-function based algorithms for semidefinite optimization
2009,
Ghami M El
Recently, the authors introduced a new class of so-called eligible kernel functions...
The strong second-order sufficient condition and constraint nondegeneracy in nonlinear semidefinite programming and their implications
2006,
Sun Defeng
For a locally optimal solution to the nonlinear semidefinite programming problem,...
The Grothendieck constant of random and pseudo-random graphs
2008,
Alon Noga
The Grothendieck constant of a graph G=(V,E) is the least constant K such that for...
Explicit optimality conditions for convex semi-infinite programming problems
2008,
Kostyukova O.I.
The article deals with convex Semi-Infinite Programming (SIP) problems. On the basis...
A numerical feasible interior point method for linear semidefinite programs
2007,
Crouzeix Jean-Pierre
This paper presents a feasible primal algorithm for linear semidefinite programming....
On semidefinite bounds for maximization of a non-convex quadratic objective over the l1 unit ball
2006,
Teboulle Marc
We consider the non-convex quadratic maximization problem subject to the l 1 unit ball...
An extension of a variant of a predictor–corrector primal–dual method from linear programming to semidefinite programming
2005,
Bastos F.
We extend a variant of a predictor–corrector primal–dual method for Linear...
An interior-point perspective on sensitivity analysis in semidefinite programming
2003,
Yildirim E.A.
We study the asymptotic behavior of the interior-point bounds arising from the work of...
A semidefinite programming approach to side chain positioning with new rounding strategies
2004,
Singh Mona
Side chain positioning is an important subproblem of the general...
Knowledge-based semidefinite linear programming classifiers
2006,
Jeyakumar V.
In this paper, we present knowledge-based support vector machine (SVM) classifiers...
An ϵ-sensitivity analysis for semidefinite programming
2005,
Park Soondal
We extend the concept of ϵ-sensitivity analysis developed for linear programming...
On the Lipschitz continuity of the solution map in semidefinite linear complementarity problems
2005,
Parthasarathy T.
In this paper, we investigate the Lipschitz continuity of the solution map in...
A semidefinite programming approach to optimal-moment bounds for convex classes of distributions
2005,
Popescu Ioana
We provide an optimization framework for computing optimal upper and lower bounds on...
A conic programming approach to generalized Tchebycheff inequalities
2005,
Zuluaga Luis F.
Consider the problem of finding optimal bounds on the expected value of piecewise...
Semi-definite positive programming relaxations for graph k-coloring in frequency assignment
2001,
Meurdesoif Philippe
In this paper we will describe a new class of coloring problems, arising from military...
On the central path for nonlinear semidefinite programming
2000,
Svaiter B.F.
In this paper we study the well definedness of the central path associated to a given...
A unified class of directly solvable semidefinite programming problems
2005,
Muramatsu Masakazu
We propose a class of semidefinite programming (SDP) problems for which an optimal...
First Page
1
2
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers