Sciweavers

95 search results - page 12 / 19
» Solving Large-Scale Nonlinear Programming Problems by Constr...
Sort
View
HEURISTICS
2008
136views more  HEURISTICS 2008»
14 years 10 months ago
Enhancing set constraint solvers with lexicographic bounds
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
Andrew Sadler, Carmen Gervet
108
Voted
SIAMJO
2010
87views more  SIAMJO 2010»
14 years 10 months ago
A Second Derivative SQP Method: Global Convergence
Abstract. Sequential quadratic programming (SQP) methods form a class of highly efficient algorithms for solving nonlinearly constrained optimization problems. Although second deri...
Nicholas I. M. Gould, Daniel P. Robinson
ICML
2007
IEEE
16 years 14 days ago
Focused crawling with scalable ordinal regression solvers
In this paper we propose a novel, scalable, clustering based Ordinal Regression formulation, which is an instance of a Second Order Cone Program (SOCP) with one Second Order Cone ...
Rashmin Babaria, J. Saketha Nath, S. Krishnan, K. ...
81
Voted
DATE
2007
IEEE
114views Hardware» more  DATE 2007»
15 years 6 months ago
Two-level microprocessor-accelerator partitioning
The integration of microprocessors and field-programmable gate array (FPGA) fabric on a single chip increases both the utility and necessity of tools that automatically move softw...
Scott Sirowy, Yonghui Wu, Stefano Lonardi, Frank V...
AUTOMATICA
2008
126views more  AUTOMATICA 2008»
14 years 11 months ago
Local stability analysis using simulations and sum-of-squares programming
The problem of computing bounds on the region-of-attraction for systems with polynomial vector fields is considered. Invariant subsets of the region-of-attraction are characterize...
Ufuk Topcu, Andrew K. Packard, Peter Seiler