Sciweavers

652 search results - page 64 / 131
» Linear Explicit Substitutions
Sort
View
SIAMJO
2008
114views more  SIAMJO 2008»
13 years 8 months ago
An Inexact SQP Method for Equality Constrained Optimization
We present an algorithm for large-scale equality constrained optimization. The method is based on a characterization of inexact sequential quadratic programming (SQP) steps that ca...
Richard H. Byrd, Frank E. Curtis, Jorge Nocedal
DAM
1998
88views more  DAM 1998»
13 years 8 months ago
Neither Reading Few Bits Twice Nor Reading Illegally Helps Much
We first consider so-called (1,+s)-branching programs in which along every consistent path at most s variables are tested more than once. We prove that any such program computing...
Stasys Jukna, Alexander A. Razborov
ML
2002
ACM
127views Machine Learning» more  ML 2002»
13 years 8 months ago
Sparse Regression Ensembles in Infinite and Finite Hypothesis Spaces
We examine methods for constructing regression ensembles based on a linear program (LP). The ensemble regression function consists of linear combinations of base hypotheses generat...
Gunnar Rätsch, Ayhan Demiriz, Kristin P. Benn...
DAM
2008
102views more  DAM 2008»
13 years 8 months ago
Formulas for approximating pseudo-Boolean random variables
We consider {0, 1}n as a sample space with a probability measure on it, thus making pseudo-Boolean functions into random variables. We then derive explicit formulas for approximat...
Guoli Ding, Robert F. Lax, Jianhua Chen, Peter P. ...
PAMI
2007
148views more  PAMI 2007»
13 years 8 months ago
Orthogonal Neighborhood Preserving Projections: A Projection-Based Dimensionality Reduction Technique
This paper considers the problem of dimensionality reduction by orthogonal projection techniques. The main feature of the proposed techniques is that they attempt to preserve both...
Effrosini Kokiopoulou, Yousef Saad