Sciweavers

2861 search results - page 154 / 573
» Constraint Programming
Sort
View
OL
2007
133views more  OL 2007»
14 years 9 months ago
An SQP-type algorithm for nonlinear second-order cone programs
We propose an SQP-type algorithm for solving nonlinear second-order cone programming (NSOCP) problems. At every iteration, the algorithm solves a convex SOCP subproblem in which th...
Hirokazu Kato, Masao Fukushima
ICLP
2004
Springer
15 years 3 months ago
Multi-agent Coordination as Distributed Logic Programming
A novel style of multi-agent system specification and deployment is described, in which familiar methods from computational logic are re-interpreted to a new context. One view of ...
David Robertson
MP
2008
91views more  MP 2008»
14 years 10 months ago
The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
We analyze the rate of local convergence of the augmented Lagrangian method for nonlinear semidefinite optimization. The presence of the positive semidefinite cone constraint requ...
Defeng Sun, Jie Sun, Liwei Zhang
ANOR
2005
124views more  ANOR 2005»
14 years 10 months ago
On Compact Formulations for Integer Programs Solved by Column Generation
Column generation has become a powerful tool in solving large scale integer programs. It is well known that most of the often reported compatibility issues between pricing subprobl...
Daniel Villeneuve, Jacques Desrosiers, Marco E. L&...
COR
2011
14 years 5 months ago
Faster integer-feasibility in mixed-integer linear programs by branching to force change
Branching in mixed-integer (or integer) linear programming requires choosing both the branching variable and the branching direction. This paper develops a number of new methods f...
Jennifer Pryor, John W. Chinneck