Results 41 to 50 of about 325 (51)

A range division and contraction approach for nonconvex quadratic program with quadratic constraints. [PDF]

Springerplus, 2016
Xue C, Jiao H, Yin J, Chen Y.
europepmc   +1 more source

AN EFFICIENT NUMERICAL METHOD FOR THE SOLUTION OF THE L(2) OPTIMAL MASS TRANSFER PROBLEM. [PDF]

SIAM J Sci Comput, 2010
Haber E, Rehman T, Tannenbaum A.
europepmc   +1 more source

An Inexact Newton-Krylov Algorithm for Constrained Diffeomorphic Image Registration. [PDF]

SIAM J Imaging Sci, 2015
Mang A, Biros G.
europepmc   +1 more source

On Tractable Convex Relaxations of Standard Quadratic Optimization Problems under Sparsity Constraints. [PDF]

J Optim Theory Appl
Bomze I, Peng B, Qiu Y, Yıldırım EA.
europepmc   +1 more source

Construction and characterization of a full-length cDNA library for the wheat stripe rust pathogen (Puccinia striiformis f. sp. tritici). [PDF]

BMC Genomics, 2007
Ling P, Wang M, Chen X, Campbell KG.
europepmc   +1 more source

Experimental Study of the Airflow Field and Fiber Motion in the Melt-Blowing Process. [PDF]

Polymers (Basel)
Wu W, Han W, Sun Y, Yi H, Wang X.
europepmc   +1 more source

A linear time algorithm for linearizing quadratic and higher-order shortest path problems. [PDF]

Math Program
Çela E, Klinz B, Lendl S, Woeginger GJ, Wulf L.   +4 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

A Cutting Plane Algorithm for Large Scale Semidefinite Relaxations

The Sharpest Cut, 2004
The recent spectral bundle method allows to compute, within reasonable time, approximate dual solutions of large scale semidefinite quadratic 0-1 programming relaxations. We show that it also generates a sequence of primal approximations that converge to
C. Helmberg
semanticscholar   +1 more source

ON THE IRREDUCIBILITY, SELF-DUALITY, AND NON-HOMOGENEITY OF COMPLETELY POSITIVE CONES

, 2013
. For a closed cone Cin R n , the completely positive cone of Cis the convex cone K C in S n generated by fuu T : u2Cg. Such a cone arises, for example, in the conic LP reformula-tion of a nonconvex quadratic minimization problem over an arbitrary set ...
M. Gowda, R. Sznajder
semanticscholar   +1 more source

Permanently Going Back and Forth between the ``Quadratic World'' and the ``Convexity World'' in Optimization

, 2002
J. Hiriart-Urruty, M. Torki
semanticscholar   +1 more source