Sciweavers

115 search results - page 2 / 23
» An Efficient Interior-Point Method for Convex Multicriteria ...
Sort
View
JOTA
2011
149views more  JOTA 2011»
13 years 6 days ago
Globally Convergent Cutting Plane Method for Nonconvex Nonsmooth Minimization
: Nowadays, solving nonsmooth (not necessarily differentiable) optimization problems plays a very important role in many areas of industrial applications. Most of the algorithms d...
Napsu Karmitsa, Mario Tanaka Filho, José He...
EOR
2007
105views more  EOR 2007»
13 years 5 months ago
Newton's method and its use in optimization
Newton’s method is a basic tool in numerical analysis and numerous applications, including operations research and data mining. We survey the history of the method, its main ide...
Boris T. Polyak
ICASSP
2011
IEEE
12 years 9 months ago
Efficient convex optimization for real-time robust beamforming with microphone arrays
This paper presents an efficient implementation of a robust adaptive beamforming algorithm based on convex optimization for applications in the processing-constrained environment...
Eric A. Durant, Ivo Merks, Bill Woods, Jinjun Xiao...
ICML
2004
IEEE
14 years 6 months ago
Multiple kernel learning, conic duality, and the SMO algorithm
While classical kernel-based classifiers are based on a single kernel, in practice it is often desirable to base classifiers on combinations of multiple kernels. Lanckriet et al. ...
Francis R. Bach, Gert R. G. Lanckriet, Michael I. ...
EOR
2010
160views more  EOR 2010»
13 years 5 months ago
A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs
We propose a modified alternate direction method for solving convex quadratically constrained quadratic semidefinite optimization problems. The method is a first-order method, the...
Jie Sun, Su Zhang