393 search results - page 31 / 79 » Convex Programming Methods for Global Optimization |
ICAL
2011
12 years 8 months ago
2011
— In this paper, a numerical method (termed, E47 algorithm) based on linear variational inequalities (LVI) is presented and investigated to solve quadratic programming (QP) probl...
ICDM
2007
IEEE
14 years 3 months ago
2007
IEEE
Censored targets, such as the time to events in survival analysis, can generally be represented by intervals on the real line. In this paper, we propose a novel support vector tec...
GLOBECOM
2006
IEEE
14 years 2 months ago
2006
IEEE
Abstract— For multi-user orthogonal frequency division multiplexing (OFDM) systems, efficient optimal rate and power allocation algorithms are presented via geometric programmin...
ICPR
2008
IEEE
14 years 10 months ago
2008
IEEE
In this paper we propose a novel prior-based variational object segmentation method in a global minimization framework which unifies image segmentation and image denoising. The id...
ATAL
2010
Springer
13 years 10 months ago
2010
Springer
Many applications in multiagent learning are essentially convex optimization problems in which agents have only limited communication and partial information about the function be...