Sciweavers

196 search results - page 6 / 40
» A finite set of functions with an EXPTIME-complete compositi...
Sort
View
JGO
2008
98views more  JGO 2008»
14 years 11 months ago
Duality for almost convex optimization problems via the perturbation approach
Abstract. We deal with duality for almost convex finite dimensional optimization problems by means of the classical perturbation approach. To this aim some standard results from th...
Radu Ioan Bot, Gábor Kassay, Gert Wanka
CDC
2010
IEEE
129views Control Systems» more  CDC 2010»
14 years 6 months ago
On parameterized Lyapunov and control Lyapunov functions for discrete-time systems
This paper deals with the existence and synthesis of parameterized-(control) Lyapunov functions (p-(C)LFs) for discrete-time nonlinear systems that are possibly subject to constrai...
Mircea Lazar, Rob H. Gielen
98
Voted
MOR
2006
95views more  MOR 2006»
14 years 11 months ago
An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems
In multicriteria optimization, several objective functions, conflicting with each other, have to be minimized simultaneously. We propose a new efficient method for approximating t...
Jörg Fliege
SSS
2009
Springer
110views Control Systems» more  SSS 2009»
15 years 4 months ago
From Local Impact Functions to Global Adaptation of Service Compositions
Abstract. The problem of self-optimization and adaptation in the context of customizable systems is becoming increasingly important with the emergence of complex software systems a...
Liliana Rosa, Luís Rodrigues, Antóni...
101
Voted
NIPS
2004
15 years 1 months ago
Nearly Tight Bounds for the Continuum-Armed Bandit Problem
In the multi-armed bandit problem, an online algorithm must choose from a set of strategies in a sequence of n trials so as to minimize the total cost of the chosen strategies. Wh...
Robert D. Kleinberg