Sciweavers

95 search results - page 8 / 19
» Solving Large-Scale Nonlinear Programming Problems by Constr...
Sort
View
ISCAS
2006
IEEE
145views Hardware» more  ISCAS 2006»
14 years 1 months ago
The wordlength determination problem of linear time invariant systems with multiple outputs - a geometric programming approach
This paper proposes two new methods for optimizing objectives and constraints. The GP approach is very general and hardware resources in finite wordlength implementation of it allo...
S. C. Chan, K. M. Tsui
SARA
2009
Springer
14 years 2 months ago
Some Interval Approximation Techniques for MINLP
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...
Nicolas Berger, Laurent Granvilliers
CCE
2004
13 years 7 months ago
An MPEC formulation for dynamic optimization of distillation operations
We consider the dynamic optimization of chemical processes with changes in the number of equilibrium phases. Recent work has shown that transitions in the number of phases can be ...
Arvind U. Raghunathan, M. Soledad Diaz, Lorenz T. ...
MP
2007
102views more  MP 2007»
13 years 7 months ago
Elastic-mode algorithms for mathematical programs with equilibrium constraints: global convergence and stationarity properties
The elastic-mode formulation of the problem of minimizing a nonlinear function subject to equilibrium constraints has appealing local properties in that, for a finite value of the...
Mihai Anitescu, Paul Tseng, Stephen J. Wright
CPAIOR
2008
Springer
13 years 9 months ago
Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...
Tino Teige, Martin Fränzle