Sciweavers

870 search results - page 18 / 174
» A New Approach to Modeling and Solving Minimal Perturbation ...
Sort
View
GECCO
2007
Springer
173views Optimization» more  GECCO 2007»
14 years 2 months ago
A hybrid GA for a supply chain production planning problem
The problem of production and delivery lot-sizing and scheduling of set of items in a two-echelon supply chain over a finite planning horizon is addressed in this paper. A single ...
Masoud Jenabi, S. Ali Torabi, S. Afshin Mansouri
SCIA
2009
Springer
305views Image Analysis» more  SCIA 2009»
14 years 2 months ago
A Convex Approach to Low Rank Matrix Approximation with Missing Data
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
Carl Olsson, Magnus Oskarsson
JMLR
2010
143views more  JMLR 2010»
13 years 6 months ago
A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
Jin Yu, S. V. N. Vishwanathan, Simon Günter, ...
ANOR
2002
100views more  ANOR 2002»
13 years 7 months ago
A Limited-Memory Multipoint Symmetric Secant Method for Bound Constrained Optimization
A new algorithm for solving smooth large-scale minimization problems with bound constraints is introduced. The way of dealing with active constraints is similar to the one used in...
Oleg P. Burdakov, José Mario Martíne...
SSIAI
2000
IEEE
14 years 8 days ago
A New Bayesian Relaxation Framework for the Estimation and Segmentation of Multiple Motions
In this paper we propose a new probabilistic relaxation framework to perform robust multiple motion estimation and segmentation from a sequence of images. Our approach uses displa...
Alexander Strehl, Jake K. Aggarwal