Results 11 to 20 of about 91 (79)

On Some Properties of Interior Methods for Optimization [Elektronisk resurs]

, 2003
This thesis consists of four independent papers concerningdifferent aspects of interior methods for optimization. Threeof the papers focus on theoretical aspects while the fourth oneconcerns some computational experiments.The systems of equations solved ...
Sporre, Göran,
core   +9 more sources

Exploiting group symmetry in truss topology optimization [PDF]

, 2007
AMS classification: 90C22, 20Cxx, 70 ...
Sotirov, Renata, Etienne de Klerk, Etienne, Klerk de, Sotirov, R., Pasechnik, Dmitrii V., Renata Sotirov, Dmitrii Pasechnik, Bai, Yanqin, Klerk, E.De, Sotirov, R.; id_orcid, de Klerk, E., Bai, Y.Q., de Klerk, E.; id_orcid, Pasechnik, D.V., Dmitrii V. Pasechnik, Yanqin Bai, Bai, Y.−Q.   +16 more
core   +2 more sources

On Semidefinite Programming Relaxations of Association Schemes With Application to Combinatorial Optimization Problems [PDF]

, 2009
AMS classification: 90C22, 20Cxx, 70 ...
de Klerk, E., Etienne de Klerk, de Klerk, E.; id_orcid, Pasechnik, D.V., Dmitrii V. Pasechnik, E. de Klerk, D.V. Pasechnik   +6 more
core   +2 more sources

Exploiting Group Symmetry in Semidefinite Programming Relaxations of the Quadratic Assignment Problem [PDF]

, 2007
We consider semidefinite programming relaxations of the quadratic assignment problem, and show how to exploit group symmetry in the problem data. Thus we are able to compute the best known lower bounds for several instances of quadratic assignment ...
Sotirov, R.; id_orcid, de Klerk, E., Etienne de Klerk, de Klerk, E.; id_orcid, Sotirov, R., Renata Sotirov   +5 more
core   +4 more sources

On global optimization with indefinite quadratics

EURO Journal on Computational Optimization, 2017
We present an algorithmic framework for global optimization problems in which the non-convexity is manifested as an indefinite-quadratic as part of the objective function.
Marcia Fampa, Jon Lee, Wendel Melo
doaj   +1 more source

Spectral Polyhedra

Forum of Mathematics, Sigma
A spectral convex set is a collection of symmetric matrices whose range of eigenvalues forms a symmetric convex set. Spectral convex sets generalize the Schur-Horn orbitopes studied by Sanyal–Sottile–Sturmfels (2011). We study this class of convex bodies,
Raman Sanyal, James Saunderson
doaj   +1 more source

Implementation of Interior Point Methods for Mixed Semidefinite and Second Order Cone Optimization Problems [PDF]

, 2002
AMS classifications: 90C22 ...
Sturm, J.F.
core   +1 more source

On the Lovasz O-number of Almost Regular Graphs With Application to Erdos-Renyi Graphs [PDF]

, 2006
AMS classifications: 05C69; 90C35 ...
Sotirov, R.; id_orcid, de Klerk, E., de Klerk, E.; id_orcid, Pasechnik, D.V., Sotirov, R., Newman, M.W.   +5 more
core   +1 more source

Avoiding Numerical Cancellation in the Interior Point Method for Solving Semidefinite Programs [PDF]

, 2001
AMS classifications: 90C22 ...
Sturm, J.F.
core   +1 more source

Minimizing condition number via convex programming [PDF]

, 2011
In this paper we consider minimizing the spectral condition number of a positive semidefinite matrix over a nonempty closed convex set Ω. We show that it can be solved as a convex programming problem, and moreover, the optimal value of the latter problem
Ting Kei Pong, Zhaosong Lu
core   +1 more source