Some remarks on Karmarkar's potential function.
Some remarks on quadratic programming with 0-1 variables
Some remarks on subdifferentiability of convex functions.
Some remarks on the space of differences of sublinear functions
Two properties concerning the space of differences of sublinear functions D(X) for a real Banach space X are proved. First, we show that for a real separable Banach space (X,‖·‖) there exists a countable family of seminorms such that D(X) becomes a Fréchet space. For X = ℝ^n this construction yields a norm such that D(ℝ^n) becomes a Banach space. Furthermore, we show that for a real Banach space with a smooth dual every sublinear Lipschitzian function can be expressed by the Fenchel conjugate of...
Some remarks on two degrees of asymmetry in the traveling salesman problem
Some Representation Theorems for Functions and Sets and their Application to Nonlinear Programming.
Some results in discrete mathematics and digital geometry by Professor Dragan Acketa.
Spatially-distributed coverage optimization and control with limited-range interactions
This paper presents coordination algorithms for groups of mobile agents performing deployment and coverage tasks. As an important modeling constraint, we assume that each mobile agent has a limited sensing or communication radius. Based on the geometry of Voronoi partitions and proximity graphs, we analyze a class of aggregate objective functions and propose coverage algorithms in continuous and discrete time. These algorithms have convergence guarantees and are spatially distributed with respect...
Spatially-distributed coverage optimization and control with limited-range interactions
This paper presents coordination algorithms for groups of mobile agents performing deployment and coverage tasks. As an important modeling constraint, we assume that each mobile agent has a limited sensing or communication radius. Based on the geometry of Voronoi partitions and proximity graphs, we analyze a class of aggregate objective functions and propose coverage algorithms in continuous and discrete time. These algorithms have convergence guarantees and are spatially distributed with...
Special Issue: Editorial
Special issue: Stochastic Programming in EURO XXII in Prague
Specifying the systematic risk of portfolios : a closed form solution
Sphärische Abbildung konvexer abgeschlossener Mengen in und ihre charakteristischen Eigenschaften
Nachdem der Begriff des sphärischen Bildes der Menge und der Begriff von sphärisch äquivalenten Mengen eingeführt wurde, werden verschiedene Zusammenhänge zwischen der Menge und ihrem sphärischen Bild untersucht und zwar unter verschiedenen Voraussetzung über (z. B. ihre Beschränkheit, Unbeschränkheit, strenge Konvexität). Die bewiesene Tatsache, dass die Menge und ihre -Umgebung sphärisch äquivalent sind, kann - sowie andere Ergebnisse der Arbeit - in der Theorie der konvexen parametrischen...
Stabilité de L'épi-convergence en Dimension Finie
Stability and accuracy functions in multicriteria combinatorial optimization
Stability and duality in convex minimization problems
Stability and sensitivity analysis for optimal control problems with control-state constraints [Book]
Stability criteria for large-scale time-delay systems: the LMI approach and the Genetic Algorithms
Stability, empirical estimates and scenario generation in stochastic optimization - applications in finance
Economic and financial processes are mostly simultaneously influenced by a random factor and a decision parameter. While the random factor can be hardly influenced, the decision parameter can be usually determined by a deterministic optimization problem depending on a corresponding probability measure. However, in applications the “underlying” probability measure is often a little different, replaced by empirical one determined on the base of data or even (for numerical reason) replaced by simpler...
Stability in -convex programming.