Results 191 to 200 of about 40,565 (244)

Online chicken carcass volume estimation using depth imaging and 3-D reconstruction. [PDF]

Poult Sci
Nyalala I, Jiayu Z, Zixuan C, Junlong C, Chen K.   +4 more
europepmc   +1 more source

AI-discovered tuning laws explain neuronal population code geometry

Tilbury R, Kwon D, Haydaroğlu A, Ratliff J, Schmutz V, Carandini M, Miller K, Stachenfeld K, Harris KD.   +8 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization

SIAM Journal on Optimization, 2003
The paper presents a sequential quadratically constrained quadratic prpgramming (SQCQP) method for solving smooth convex programs. The SQCQP method solves at each iteration a subproblem that involves convex quadratic inequality constraints and a convex quadratic objective function. This subproblem is formulated as a second-order cone program.
Fukushima, Masao, Luo, Zhi-Quan, Tseng, Paul   +2 more
openaire   +4 more sources

Convex Relaxations of (0, 1)-Quadratic Programming

Mathematics of Operations Research, 1995
We consider three parametric relaxations of the (0, l)-quadratic programming problem. These relaxations are to: quadratic maximization over simple box constraints, quadratic maximization over the sphere, and the maximum eigenvalue of a bordered matrix.
Poljak, Svatopluk, Wolkowicz, Henry
openaire   +1 more source

Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs

Optimization Methods and Software, 2013
Nonconvex quadratic constraints can be linearized to obtain relaxations in a well-understood manner. We propose to tighten the relaxation by using second-order cone constraints, resulting in a convex quadratic relaxation. Our quadratic approximation to the bilinear term is compared to the linear McCormick bounds.
John E. Mitchell, Jong-Shi Pang, Bin Yu
openaire   +1 more source

Convex Quadratic Programming Approach

Journal of Global Optimization, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Quadratic convex reformulations for quadratic 0–1 programming

4OR, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

An Efficient Algorithm for Solving Convex–Convex Quadratic Fractional Programs

Journal of Optimization Theory and Applications, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yamamoto, R., Konno, H.
openaire   +2 more sources

On Some Properties of Quadratic Programs with a Convex Quadratic Constraint

SIAM Journal on Optimization, 1998
Summary: We consider the problem of minimizing a (possibly nonconvex) quadratic function with a quadratic constraint. We point out some new properties of the problem. In particular, in the first part of the paper, we show that (i) given a KKT point that is not a global minimizer, it is easy to find a ``better'' feasible point; (ii) strict ...
LUCIDI, Stefano, PALAGI, Laura, ROMA, Massimo   +2 more
openaire   +3 more sources

An unconstrained convex programming approach to solving convex quadratic programming problems

Optimization, 1993
In this paper, we derive an unconstrained convex programming approach to solving convex quadratic programming problems in standard form. Related duality theory is established by using two simple inequalities. An ∊-optimal solution is obtained by solving an unconstrained dual convex program. A dual-to-primal conversion formula is also provided.
S.C. fang, H.-S.J. Tsao
openaire   +1 more source