Sciweavers

60 search results - page 8 / 12
» Necessary optimality conditions for constrained optimization...
Sort
View
ECAI
2000
Springer
14 years 27 days ago
Scheduling Meetings Using Distributed Valued Constraint Satisfaction Algorithm
Abstract. Scheduling meetings is generally difficult in that it attempts to satisfy the preferences of all participants. However, all participants can agree to a schedule in which...
Takuo Tsuruta, Toramatsu Shintani
COR
2008
142views more  COR 2008»
13 years 8 months ago
Modeling and solving the rooted distance-constrained minimum spanning tree problem
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
Luis Gouveia, Ana Paias, Dushyant Sharma
CORR
2011
Springer
220views Education» more  CORR 2011»
13 years 3 months ago
On a linear programming approach to the discrete Willmore boundary value problem and generalizations
We consider the problem of finding (possibly non connected) discrete surfaces spanning a finite set of discrete boundary curves in the three-dimensional space and minimizing (glo...
Thomas Schoenemann, Simon Masnou, Daniel Cremers
DCC
2004
IEEE
14 years 8 months ago
Efficient Bit Allocation for Dependent Video Coding
A steepest descent based bit allocation method with polynomial iteration complexity for minimizing the sum of frame distortions under a total bit rate constraint is presented for ...
Yegnaswamy Sermadevi, Sheila S. Hemami
MP
2010
154views more  MP 2010»
13 years 7 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