Sciweavers

103 search results - page 13 / 21
» siamjo 2008
Sort
View
SIAMJO
2008
92views more  SIAMJO 2008»
13 years 9 months ago
A Trust Region Spectral Bundle Method for Nonconvex Eigenvalue Optimization
We present a nonsmooth optimization technique for nonconvex maximum eigenvalue functions and for nonsmooth functions which are infinite maxima of eigenvalue functions. We prove glo...
Pierre Apkarian, Dominikus Noll, O. Prot
SIAMJO
2008
110views more  SIAMJO 2008»
13 years 9 months ago
Subdifferential Calculus Rules in Convex Analysis: A Unifying Approach Via Pointwise Supremum Functions
We provide a rule to calculate the subdifferential of the pointwise supremum of an arbitrary family of convex functions defined on a real locally convex topological vector space. ...
Abderrahim Hantoute, Marco A. López, Consta...
SIAMJO
2000
63views more  SIAMJO 2000»
13 years 9 months ago
Pattern Search Methods for Linearly Constrained Minimization
This paper deals with generalized pattern search (GPS) algorithms for linearly constrained optimization. At each iteration, the GPS algorithm generates a set of directions that con...
Robert Michael Lewis, Virginia Torczon
SIAMJO
2000
108views more  SIAMJO 2000»
13 years 9 months ago
Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
Mathematical programs with nonlinear complementarity constraints are reformulated using better-posed but nonsmooth constraints. We introduce a class of functions, parameterized by...
Houyuan Jiang, Daniel Ralph
SIAMJO
2000
74views more  SIAMJO 2000»
13 years 9 months ago
A Specialized Interior-Point Algorithm for Multicommodity Network Flows
Abstract. Despite the efficiency shown by interior-point methods in large-scale linear programming, they usually perform poorly when applied to multicommodity flow problems. The ne...
Jordi Castro