Sciweavers

2343 search results - page 390 / 469
» Visual-Concept Search Solved
Sort
View
161
Voted
SIAMJO
2008
114views more  SIAMJO 2008»
15 years 4 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
SIAMSC
2008
182views more  SIAMSC 2008»
15 years 4 months ago
A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation
We propose a distributed algorithm for solving Euclidean metric realization problems arising from large 3D graphs, using only noisy distance information, and without any prior kno...
Pratik Biswas, Kim-Chuan Toh, Yinyu Ye
AEI
2005
99views more  AEI 2005»
15 years 4 months ago
Comparison among five evolutionary-based optimization algorithms
Evolutionary algorithms (EAs) are stochastic search methods that mimic the natural biological evolution and/or the social behavior of species. Such algorithms have been developed ...
Emad Elbeltagi, Tarek Hegazy, Donald E. Grierson
IJON
2007
100views more  IJON 2007»
15 years 4 months ago
Minimum range approach to blind partial simultaneous separation of bounded sources: Contrast and discriminacy properties
The blind source separation (BSS) problem is often solved by maximizing objective functions reflecting the statistical independence between outputs. Since global maximization may...
Frédéric Vrins, Dinh-Tuan Pham
118
Voted
AMC
2005
138views more  AMC 2005»
15 years 4 months ago
Optimal centers in branch-and-prune algorithms for univariate global optimization
We present an interval branch-and-prune algorithm for computing verified enclosures for the global minimum and all global minimizers of univariate functions subject to bound const...
D. G. Sotiropoulos, T. N. Grapsa