Sciweavers

393 search results - page 17 / 79
» Convex Programming Methods for Global Optimization
Sort
View
ICCV
2007
IEEE
14 years 9 months ago
Convex Optimization for Deformable Surface 3-D Tracking
3?D shape recovery of non-rigid surfaces from 3?D to 2?D correspondences is an under-constrained problem that requires prior knowledge of the possible deformations. State-of-the-a...
Mathieu Salzmann, Richard Hartley, Pascal Fua
OL
2007
133views more  OL 2007»
13 years 7 months ago
An SQP-type algorithm for nonlinear second-order cone programs
We propose an SQP-type algorithm for solving nonlinear second-order cone programming (NSOCP) problems. At every iteration, the algorithm solves a convex SOCP subproblem in which th...
Hirokazu Kato, Masao Fukushima
CDC
2010
IEEE
112views Control Systems» more  CDC 2010»
13 years 2 months ago
Online Convex Programming and regularization in adaptive control
Online Convex Programming (OCP) is a recently developed model of sequential decision-making in the presence of time-varying uncertainty. In this framework, a decisionmaker selects ...
Maxim Raginsky, Alexander Rakhlin, Serdar Yük...
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, ...
NC
2002
210views Neural Networks» more  NC 2002»
13 years 7 months ago
Recent approaches to global optimization problems through Particle Swarm Optimization
This paper presents an overview of our most recent results concerning the Particle Swarm Optimization (PSO) method. Techniques for the alleviation of local minima, and for detectin...
Konstantinos E. Parsopoulos, Michael N. Vrahatis