Buscar
Mostrando ítems 1-10 de 184
From convex feasibility to convex constrained optimization using block action projection methods and underrelaxation
(Wiley-blackwellMaldenEUA, 2009)
Orthogonal packing of identical rectangles within isotropic convex regions
(PERGAMON-ELSEVIER SCIENCE LTD, 2010)
A mixed integer continuous nonlinear model and a solution method for the problem of orthogonally packing identical rectangles within an arbitrary convex region are introduced in the present work. The convex region is assumed ...
Circumcentering outer-approximate projections and reflections for the convex feasibility problem
(2021-03-26)
Recentemente, algoritmos baseados em circuncentros foram aplicados para resolver problemas gerais de viabilidade convexa. Para superar computações custosas de projeções e reflexões em conjuntos convexos, nós apresentamos ...
Feasibility and cost minimisation for a lithium extraction problem
(Elsevier Ltd, 2019)
In this paper we address the problem of allocating extraction pumps to wells, when exploiting lithium rich brines, as part of the production of lithium salts. The problem of choosing the location of extraction wells is ...
Feasibility and cost minimisation for a lithium extraction problem
(Elsevier, 2020)
In this paper we address the problem of allocating extraction pumps to wells, when exploiting lithium rich brines, as part of the production of lithium salts. The problem of choosing the location of extraction wells is ...
Feasibility and Cost Minimisation for a Lithium Extraction Problem
(2019)
In this paper we address the problem of allocating extraction pumps to wells, when exploiting lithium rich brines, as part of the production of lithium salts. The problem of choosing the location of extraction wells is ...
Stability of the Feasible Set Mapping of Linear Systems with an Exact Constraint Set
(SPRINGER, 2008-12)
This paper deals with the stability of the feasible set mapping of linear systems of an arbitrary number (possibly infinite) of equations and inequalities such that the variable x ranges on a certain fixed constraint set ...
INCREMENTAL SUBGRADIENTS FOR CONSTRAINED CONVEX OPTIMIZATION: A UNIFIED FRAMEWORK AND NEW METHODS
(Siam PublicationsPhiladelphiaEUA, 2009)
Penalty and barrier methods for convex semidefinite programming
(PHYSICA-VERLAG GMBH & CO, 2006-05)
In this paper we present penalty and barrier methods for solving general convex semidefinite programming problems. More precisely, the constraint set is described by a convex operator that takes its values in the cone of ...
Modelling network constrained economic dispatch problems
(Springer, 2013)
The behavior of DC load flow formulations when they are used in economic
dispatch and nodal pricing models is discussed. It is demonstrated that nonnegative
prices in these models are sufficient to guarantee global ...