Sciweavers

103 search results - page 6 / 21
» siamjo 2008
Sort
View
SIAMJO
2002
102views more  SIAMJO 2002»
13 years 9 months ago
Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems
We consider a conic-quadratic (and in particular a quadratically constrained) optimization problem with uncertain data, known only to reside in some uncertainty set U. The robust ...
Aharon Ben-Tal, Arkadi Nemirovski, Cees Roos
SIAMJO
2002
73views more  SIAMJO 2002»
13 years 9 months ago
Nonlinearly Constrained Best Approximation in Hilbert Spaces: The Strong CHIP and the Basic Constraint Qualification
We study best approximation problems with nonlinear constraints in Hilbert spaces. The strong "conical hull intersection property" (CHIP) and the "basic constraint q...
Chong Li, Xiao-Qing Jin
SIAMJO
2010
133views more  SIAMJO 2010»
13 years 8 months ago
Infeasibility Detection and SQP Methods for Nonlinear Optimization
This paper addresses the need for nonlinear programming algorithms that provide fast local convergence guarantees no matter if a problem is feasible or infeasible. We present an a...
Richard H. Byrd, Frank E. Curtis, Jorge Nocedal
SIAMJO
2010
58views more  SIAMJO 2010»
13 years 8 months ago
Tame Nonsmooth Inverse Mapping Theorems
We give several versions of local and global inverse mapping theorem for tame non necessarily smooth, mappings. Here tame mapping means a mapping which is subanalytic or, more gene...
Toshizumi Fukui, Krzysztof Kurdyka, Laurentiu Paun...
SIAMJO
2008
57views more  SIAMJO 2008»
13 years 9 months ago
Universal Confidence Sets for Solutions of Optimization Problems
We consider random approximations to deterministic optimization problems. The objective function and the constraint set can be approximated simultaneously. Relying on concentratio...
Silvia Vogel