Sciweavers

14 search results - page 1 / 3
» A first-order interior-point method for linearly constrained...
Sort
View
SIAMSC
2010
132views more  SIAMSC 2010»
14 years 4 months ago
An Interior-Point Algorithm for Large-Scale Nonlinear Optimization with Inexact Step Computations
We present a line-search algorithm for large-scale continuous optimization. The algorithm is matrix-free in that it does not require the factorization of derivative matrices. Inste...
Frank E. Curtis, Olaf Schenk, Andreas Wächter
EOR
2010
160views more  EOR 2010»
14 years 10 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
114
Voted
MP
2011
14 years 5 months ago
A first-order interior-point method for linearly constrained smooth optimization
Abstract: We propose a first-order interior-point method for linearly constrained smooth optimization that unifies and extends first-order affine-scaling method and replicator d...
Paul Tseng, Immanuel M. Bomze, Werner Schachinger
KDD
2007
ACM
197views Data Mining» more  KDD 2007»
15 years 10 months ago
Learning the kernel matrix in discriminant analysis via quadratically constrained quadratic programming
The kernel function plays a central role in kernel methods. In this paper, we consider the automated learning of the kernel matrix over a convex combination of pre-specified kerne...
Jieping Ye, Shuiwang Ji, Jianhui Chen
ECCV
2010
Springer
15 years 14 days ago
Face Image Relighting using Locally Constrained Global Optimization
A face image relighting method using locally constrained global optimization is presented in this paper. Based on the empirical fact that common radiance environments are locally h...