Sciweavers

124 search results - page 9 / 25
» Optimality Conditions via Exact Penalty Functions
Sort
View
SIAMJO
2008
114views more  SIAMJO 2008»
13 years 9 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
MP
2002
195views more  MP 2002»
13 years 9 months ago
Nonlinear rescaling vs. smoothing technique in convex optimization
We introduce an alternative to the smoothing technique approach for constrained optimization. As it turns out for any given smoothing function there exists a modification with part...
Roman A. Polyak
FSE
2007
Springer
115views Cryptology» more  FSE 2007»
14 years 4 months ago
Improving the Security of MACs Via Randomized Message Preprocessing
Abstract. “Hash then encrypt” is an approach to message authentication, where first the message is hashed down using an ε-universal hash function, and then the resulting k-bi...
Yevgeniy Dodis, Krzysztof Pietrzak
CORR
2008
Springer
133views Education» more  CORR 2008»
13 years 10 months ago
Estimating divergence functionals and the likelihood ratio by convex risk minimization
We develop and analyze M-estimation methods for divergence functionals and the likelihood ratios of two probability distributions. Our method is based on a non-asymptotic variatio...
XuanLong Nguyen, Martin J. Wainwright, Michael I. ...
TIT
2011
119views more  TIT 2011»
13 years 4 months ago
Minimax Robust Quickest Change Detection
—The popular criteria of optimality for quickest change detection procedures are the Lorden criterion, the Pollak criterion, and the Bayesian criterion. In this paper, a robust v...
Jayakrishnan Unnikrishnan, Venugopal V. Veeravalli...