Sciweavers

77 search results - page 4 / 16
» A New Exchange Method for Convex Semi-Infinite Programming
Sort
View
ANOR
2006
69views more  ANOR 2006»
13 years 7 months ago
A splitting method for stochastic programs
This paper derives a new splitting-based decomposition algorithm for convex stochastic programs. It combines certain attractive features of the progressive hedging algorithm of Roc...
Teemu Pennanen, Markku Kallio
DISOPT
2008
138views more  DISOPT 2008»
13 years 7 months ago
An algorithmic framework for convex mixed integer nonlinear programs
This paper is motivated by the fact that mixed integer nonlinear programming is an important and difficult area for which there is a need for developing new methods and software f...
Pierre Bonami, Lorenz T. Biegler, Andrew R. Conn, ...
MP
2002
195views more  MP 2002»
13 years 7 months ago
Nonlinear rescaling vs. smoothing technique in convex optimization
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...
Roman A. Polyak
TASLP
2010
78views more  TASLP 2010»
13 years 2 months ago
Solving Demodulation as an Optimization Problem
We introduce two new methods for the demodulation of acoustic signals by posing the problem in a convex optimization framework. This allows the parameters of the modulator and carr...
Gregory Sell, Malcolm Slaney
PAMI
2007
125views more  PAMI 2007»
13 years 7 months ago
Matching by Linear Programming and Successive Convexification
—We present a novel convex programming scheme to solve matching problems, focusing on the challenging problem of matching in a large search range and with cluttered background. M...
Hao Jiang, Mark S. Drew, Ze-Nian Li