Buscar
Mostrando ítems 11-20 de 382
A CONVERGENCE RESULT FOR ASYNCHRONOUS ALGORITHMS AND APPLICATIONS
(Universidad Católica del Norte, Departamento de Matemáticas, 2007)
NASH game and mixed H2/H∞ control
(Institute of Electrical and Electronics Engineers (IEEE), 1997-01-01)
In this work a Nonzero-Sum NASH game related to the H2 and H∞ control problems is formulated in the context of convex optimization theory. The variables of the game are limiting bounds for the H2 and H∞ norms, and the final ...
Critical angles between two convex cones I. General theory
(Springer, 2016)
The concept of critical (or principal) angle between two linear subspaces has applications in statistics, numerical linear algebra, and other areas. Such concept has been abundantly studied in the literature, both from a ...
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 ...
Optimality conditions for nonlinear infinite programming problems
(2015-08-29)
An infinite programming problem consists in minimizing a functional defined on a real Banach space under an infinite number of constraints. The main purpose of this article is to provide sufficient conditions of optimality ...
Hessian Riemannian gradient flows in convex programming
(SIAM PUBLICATIONS, 2004)
In view of solving theoretically constrained minimization problems, we investigate the properties of the gradient flows with respect to Hessian Riemannian metrics induced by Legendre functions. The first result characterizes ...
INCREMENTAL SUBGRADIENTS FOR CONSTRAINED CONVEX OPTIMIZATION: A UNIFIED FRAMEWORK AND NEW METHODS
(Siam PublicationsPhiladelphiaEUA, 2009)
PARALLEL SYNCRHRONOUS ALGORITHM FOR NONLINEAR FIXED POINT PROBLEMS
(Universidad Católica del Norte, Departamento de Matemáticas, 2004)
Simultaneous calculation of chemical and phase equilibria using convexity analysis
(Pergamon-elsevier Science LtdOxfordInglaterra, 2011)
Information, Complexity and Structure in Convex Optimization.
(2015)
This thesis is focused on the limits of performance of large-scale convex optimization algorithms. Classical theory of oracle complexity, first proposed by Nemirovski and Yudin in 1983, successfully established the ...