نتایج جستجو برای: convex approximation
تعداد نتایج: 245576 فیلتر نتایج به سال:
The problem of cutting a convex polygon P out of a piece of planar material Q with minimum total cutting length is a well studied problem in computational geometry. Researchers studied several variations of the problem, such as P and Q are convex or non-convex polygons and the cuts are line cuts or ray cuts. In this paper we consider yet another variation of the problem where Q is a circle and ...
We investigate constrained optimal control problems for linear stochastic dynamical systems evolving in discrete time. We consider minimization of an expected value cost subject to probabilistic constraints. We study the convexity of a finite-horizon optimization problem in the case where the control policies are affine functions of the disturbance input. We propose an expectation-based method ...
This paper proposes a constrained stochastic successive convex approximation (CSSCA) algorithm to find a stationary point for a general non-convex stochastic optimization problem, whose objective and constraint functions are nonconvex and involve expectations over random states. The existing methods for non-convex stochastic optimization, such as the stochastic (average) gradient and stochastic...
This paper addresses the problem of capturing nondominated points on convex Pareto frontiers, which are encountered in invex multi-objective programming problems. An algorithm to find a piecewise linear approximation of the nondominated set of convex Pareto frontier are applied. Index Term-Approximation, Nondominated points, Invex multi-objective problems, Block norms.
In an interference limited network, joint power and admission control (JPAC) aims at supporting a maximum number of links at their specified signal to interference plus noise ratio (SINR) targets while using a minimum total transmission power. Various convex approximation deflation approaches have been developed for the JPAC problem. In this paper, we propose an efficient polynomial time non-co...
It is shown that every equi-affine invariant and upper semicontinuous valuation on the space of convex discs is a linear combination of the Euler characteristic, area, and affine length. Asymptotic formulae for approximation of convex discs by polygons are derived, extending results of L. Fejes Tóth from smooth convex discs to general convex discs. 1991 AMS subject classification: 52A10, 53A15,...
W study optimization problems with value-at-risk (VaR) constraints. Because it lacks subadditivity, VaR is not a coherent risk measure and does not necessarily preserve the convexity. Thus, the problems we consider are typically not provably convex. As such, the conditional value-at-risk (CVaR) approximation is often used to handle such problems. Even though the CVaR approximation is known as t...
The problem Minimum Convex Cover of covering a given polygon with a minimum number of (possibly overlapping) convex polygons is known to be NP -hard, even for polygons without holes [3]. We propose a polynomial-time approximation algorithm for this problem for polygons with or without holes that achieves an approximation ratio of O(logn), where n is the number of vertices in the input polygon. ...
We revisit two NP-hard geometric partitioning problems – convex decomposition and surface approximation. Building on recent developments in geometric separators, we present quasi-polynomial time algorithms for these problems with improved approximation guarantees. ∗[email protected] †[email protected] ‡[email protected] 1 ar X iv :1 40 4. 37 76 v1 [ cs .C G ] 1 ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید