Sciweavers

18 search results - page 2 / 4
» An SQP-type algorithm for nonlinear second-order cone progra...
Sort
View
MP
2008
91views more  MP 2008»
13 years 5 months ago
The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
We analyze the rate of local convergence of the augmented Lagrangian method for nonlinear semidefinite optimization. The presence of the positive semidefinite cone constraint requ...
Defeng Sun, Jie Sun, Liwei Zhang
JMLR
2006
175views more  JMLR 2006»
13 years 5 months ago
Learning Sparse Representations by Non-Negative Matrix Factorization and Sequential Cone Programming
We exploit the biconvex nature of the Euclidean non-negative matrix factorization (NMF) optimization problem to derive optimization schemes based on sequential quadratic and secon...
Matthias Heiler, Christoph Schnörr
ACCV
2007
Springer
13 years 11 months ago
Optimal Algorithms in Multiview Geometry
This is a survey paper summarizing recent research aimed at finding guaranteed optimal algorithms for solving problems in Multiview Geometry. Many of the traditional problems in M...
Richard I. Hartley, Fredrik Kahl
KDD
2006
ACM
201views Data Mining» more  KDD 2006»
14 years 6 months ago
Clustering based large margin classification: a scalable approach using SOCP formulation
This paper presents a novel Second Order Cone Programming (SOCP) formulation for large scale binary classification tasks. Assuming that the class conditional densities are mixture...
J. Saketha Nath, Chiranjib Bhattacharyya, M. Naras...
OL
2007
156views more  OL 2007»
13 years 5 months ago
A trust region SQP algorithm for mixed-integer nonlinear programming
We propose a modified sequential quadratic programming (SQP) method for solving mixed-integer nonlinear programming problems. Under the assumption that integer variables have a s...
Oliver Exler, Klaus Schittkowski