Results 31 to 40 of about 73 (71)
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
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
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
, 2007 We present a quadratic Discrete-time Optimal Control problem generator, written in C, with options for Degeneracy, Activity and Conditioning (DOCDAC) .
Anthony Graham, Daniel Ralph
core
Equivalence Theorem for Simple Coordination Games
In this note, we consider simple coordination games, with each player having the same number of pure strategies to choose from. We model the problem as a “pie-division” problem. Let ‘n’ denote the number of strategies available to each of the two players.
Lahiri, Somdeb
core +1 more source
On quasi-solution to infeasible linear complementarity problem obtained by Lemke’s method
Open Mathematics, 2004 Popov L.
doaj +1 more source
Numerical Analysis of Airflow Fields from New Melt-Blowing Dies for Dual-Slot Jets. [PDF]
ACS Omega, 2020 Wang Y, Zhou J, Gao X.
europepmc +1 more source