Sciweavers

306 search results - page 39 / 62
» On the Minimal Uncompletable Word Problem
Sort
View
DM
2008
50views more  DM 2008»
13 years 7 months ago
Searching monotone multi-dimensional arrays
A d-dimensional array of real numbers is called monotone increasing if its entries are increasing along each dimension. Given An,d, a monotone increasing d-dimensional array with ...
Yongxi Cheng, Xiaoming Sun, Yiqun Lisa Yin
MP
2006
107views more  MP 2006»
13 years 7 months ago
Optimality conditions in portfolio analysis with general deviation measures
Optimality conditions are derived for problems of minimizing a general measure of deviation of a random variable, with special attention to situations where the random variable cou...
R. Tyrrell Rockafellar, Stan Uryasev, Michael Zaba...
MP
2006
175views more  MP 2006»
13 years 7 months ago
Conditional Value-at-Risk in Stochastic Programs with Mixed-Integer Recourse
In classical two-stage stochastic programming the expected value of the total costs is minimized. Recently, mean-risk models - studied in mathematical finance for several decades -...
Rüdiger Schultz, Stephan Tiedemann
JUCS
2007
105views more  JUCS 2007»
13 years 7 months ago
Graded Sparse Graphs and Matroids
: Sparse graphs and their associated matroids play an important role in rigidity theory, where they capture the combinatorics of some families of generic minimally rigid structures...
Audrey Lee, Ileana Streinu, Louis Theran
MP
2010
154views more  MP 2010»
13 years 5 months ago
A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties
Abstract. We present a null-space primal-dual interior-point algorithm for solving nonlinear optimization problems with general inequality and equality constraints. The algorithm a...
Xinwei Liu, Yaxiang Yuan