10 search results - page 2 / 2 » An interior-point piecewise linear penalty method for nonlin... |
FOCS
1992
IEEE
13 years 9 months ago
1992
IEEE
Consider a convex set P in IRd and a piecewise polynomial concave function F: P IR. Let A be an algorithm that given a point x IRd computes F(x) if x P, or returns a concave po...
SIAMJO
2008
13 years 5 months ago
2008
We present an algorithm for large-scale equality constrained optimization. The method is based on a characterization of inexact sequential quadratic programming (SQP) steps that ca...
MP
2002
13 years 5 months ago
2002
We introduce an alternative to the smoothing technique approach for constrained optimization. As it turns out for any given smoothing function there exists a modification with part...
DAC
2003
ACM
14 years 6 months ago
2003
ACM
This paper presents a novel partial assignment technique (PAT) that decides which tasks should be assigned to the same resource without explicitly defining assignment of these tas...
ICDE
2010
IEEE
14 years 7 days ago
2010
IEEE
— To cope with bursty arrivals of high-volume data, a DSMS has to shed load while minimizing the degradation of Quality of Service (QoS). In this paper, we show that this problem...