Results 21 to 30 of about 69 (69)
A note on variability of interval data
Interval data, Linear and quadratic programming, Search algorithms, 68T20, 90C05, 90C20,
Miroslav Brzezina +2 more
core +1 more source
Quadratic nonconvex optimization, Regularized Lagrangian, Strong duality, Quadratic constraints, Linear equality constraints, Trust-region problems, Alternative theorems, 90C26, 90C46, 90C20, 90C30,
V. Jeyakumar, Guoyin Li
core +1 more source
Investigação experimental do transiente térmico no processo de sucção de compressores de refrigeração doméstica [PDF]
, 2012 Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico, Programa de Pós-Graduação em Engenharia Mecânica, Florianópolis, 2009.A análise térmica detalhada do sistema de sucção de compressores pode permitir um aumento ...
Morriesen, André
core
Convex Relaxations Of 0-1 Quadratic Programming
, 1993 We consider three parametric relaxations of the 0-1 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. When
Svatopluk Poljak, Henry Wolkowicz
core
A Two-steps Fixed-point Method for the Simplicial Cone Constrained Convex Quadratic Optimization
In this paper, we deal with the resolution of the simplicial cone constrained convex quadratic optimization (abbreviated SCQO). It is known that the optimality conditions of SCQO is only a standard linear complementarity problem (LCP).
ACHACHE, Mohamed, KHALDI, Merzaka
core +1 more source
Randomized Algorithms For The Separation Of Point Sets And For Solving Quadratic Programs
, 2007 . A randomized algorithm for finding a hyperplane separating two finite point sets in the Euclidean space R d and a randomized algorithm for solving linearly constrained general convex quadratic problems are proposed.
N.D. Botkin
core
Steerable Near-Quadrature Filter Pairs in Three Dimensions. [PDF]
SIAM J Imaging Sci, 2022 Tang TM, Tagare HD.
europepmc +1 more source
A criss-cross algoritmus új változatai lineáris komplementaritási feladatokra
, 2019 Új típusú criss-cross módszereket általánosítunk elégséges mátrixú lineáris komplementaritási feladatokra (LCP). A legtöbb LCP megoldó algoritmus előre feltételez bizonyos tulajdonságokat a feladat mátrixáról.
CSIZMADIA, Zsolt, ILLÉS, Tibor
core
Measurement and Comparison of Melt-Blowing Airflow Fields: Nozzle Modifications to Reduce Turbulence and Fibre Whipping. [PDF]
Polymers (Basel), 2021 Yang Y, Zeng Y.
europepmc +1 more source
A Global Optimality Criterion for Nonconvex Quadratic Programming over a Simplex
, 1998 In this paper we propose a global optimality criterion for globally minimizing a quadratic form over the standard simplex, which in addition provides a sharp lower bound for the optimal value.
Ivo Nowak
core