Sciweavers

103 search results - page 16 / 21
» siamjo 2008
Sort
View
SIAMJO
2002
115views more  SIAMJO 2002»
13 years 9 months ago
Superlinearly Convergent Algorithms for Solving Singular Equations and Smooth Reformulations of Complementarity Problems
We propose a new algorithm for solving smooth nonlinear equations in the case where their solutions can be singular. Compared to other techniques for computing singular solutions, ...
Alexey F. Izmailov, Mikhail V. Solodov
SIAMJO
2002
117views more  SIAMJO 2002»
13 years 9 months ago
Analysis of Generalized Pattern Searches
This paper contains a new convergence analysis for the Lewis and Torczon generalized pattern search (GPS) class of methods for unconstrained and linearly constrained optimization. ...
Charles Audet, J. E. Dennis Jr.
SIAMJO
2010
84views more  SIAMJO 2010»
13 years 8 months ago
A Redistributed Proximal Bundle Method for Nonconvex Optimization
Proximal bundle methods have been shown to be highly successful optimization methods for unconstrained convex problems with discontinuous first derivatives. This naturally leads ...
Warren Hare, Claudia A. Sagastizábal
SIAMJO
2008
108views more  SIAMJO 2008»
13 years 9 months ago
Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
This paper discusses how to find the global minimum of functions that are summations of small polynomials ("small" means involving a small number of variables). Some spa...
Jiawang Nie, James Demmel
SIAMJO
2008
85views more  SIAMJO 2008»
13 years 9 months ago
Explicit Reformulations for Robust Optimization Problems with General Uncertainty Sets
We consider a rather general class of mathematical programming problems with data uncertainty, where the uncertainty set is represented by a system of convex inequalities. We prove...
Igor Averbakh, Yun-Bin Zhao