Sciweavers

337 search results - page 29 / 68
» Sparse Optimization for Second Order Kernel Methods
Sort
View
SIAMJO
2002
133views more  SIAMJO 2002»
13 years 7 months ago
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
Abstract. Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective...
Philip E. Gill, Walter Murray, Michael A. Saunders
ICASSP
2011
IEEE
12 years 11 months ago
A-Functions: A generalization of Extended Baum-Welch transformations to convex optimization
We introduce the Line Search A-Function (LSAF) technique that generalizes the Extended-Baum Welch technique in order to provide an effective optimization technique for a broader s...
Dimitri Kanevsky, David Nahamoo, Tara N. Sainath, ...

Publication
794views
15 years 3 months ago
A Fast Implementation of The Level Set Method Without Solving Partial Differential Equations
"The level set method is popular in the numerical implementation of curve evolution, but its high computational cost is a bottleneck for real-time applications. In this report...
Yonggang Shi, William Clem Karl
SIAMSC
2008
147views more  SIAMSC 2008»
13 years 7 months ago
Global and Finite Termination of a Two-Phase Augmented Lagrangian Filter Method for General Quadratic Programs
We present a two-phase algorithm for solving large-scale quadratic programs (QPs). In the first phase, gradient-projection iterations approximately minimize an augmented Lagrangian...
Michael P. Friedlander, Sven Leyffer
CCE
2004
13 years 7 months ago
A decomposition method for synthesizing complex column configurations using tray-by-tray GDP models
This paper describes an optimization procedure for the synthesis of complex distillation configurations. A superstructure based on the Reversible Distillation Sequence Model (RDSM...
Mariana Barttfeld, Pío A. Aguirre, Ignacio ...