Distributed Constraint Optimisation and Search Algorithms form a vital framework for addressing complex decision‐making and scheduling problems in multi-agent systems. These algorithms distribute ...

When solving the general smooth nonlinear and possibly nonconvex optimization problem involving equality and/or inequality constraints, an approximate first-order critical point of accuracy ϵ can be ...

Sequential optimality conditions for constrained optimization are necessarily satisfied by local minimizers, independently of the fulfillment of constraint qualifications. These conditions support the ...

On December 8, 2021, Kari Rantanen of the Constraint Reasoning and Optimization group successfully defended his doctoral thesis Optimization Algorithms for Learning Graphical Model Structures. M.Sc.