Publications related to A Spatial Branch and Bound Algorithm for Continuous Pricing with Advanced Discrete Choice Demand Modeling

Time-Optimal Path Following for Robots With Convex-Concave Constraints Using Sequential Convex Programming

Time-optimal path following considers the problem of moving along a predetermined geometric path in minimum time. In the case of a robotic manipulator with simplified constraints, a convex reformulation of this optimal control problem has been derived prev ...

Institute of Electrical and Electronics Engineers2013

Design and operations of gas transmission networks

Frédéric Louis François Babonneau

Problems dealing with the design and the operations of gas transmission networks are challenging. The difficulty mainly arises from the simultaneous modeling of gas transmission laws and of the investment costs. The combination of the two yields a non-line ...

2013

A convex optimization approach for image recovery from nonlinear measurements in optical interferometry

Yves Wiaux, Rafael Eduardo Carrillo Rangel, Anna Auria Rasclosa

Image recovery in optical interferometry is an ill-posed nonlinear inverse problem arising from incomplete power spectrum and bi-spectrum measurements. We formulate a linear version of the problem for the order-3 tensor formed by the tensor product of the ...

2013

Convex computation of the region of attraction of polynomial control systems

Milan Korda

We address the long-standing problem of computing the region of attraction (ROA) of a target set (typically a neighborhood of an equilibrium point) of a controlled nonlinear system with polynomial dynamics and semialgebraic state and input constraints. We ...

2013

Energy-Efficient Opportunistic Collaborative Sensing

Karl Aberer, Julien Eberle, Zhixian Yan

This paper studies mobile sensing in a complete distributed and opportunistic scheme. We present a novel sensing strategy for sensing nodes without movement constraints. This strategy offers information sharing and sensor scheduling that maximizes the bene ...

IEEE2013

Non-convex optimization for robust multi-view imaging

Pierre Vandergheynst, Gilles Puy

We study the multi-view imaging problem where one has to reconstruct a set of l images, representing a single scene, from a few measurements made at different viewpoints. We first express the solution of the problem as the minimizer of a non-convex objecti ...

2013

An exact algorithm for the integrated planning of berth allocation and quay crane assignment

Michel Bierlaire, Matteo Salani, Ilaria Vacca

In this paper we study the simultaneous optimization of berth allocation and quay crane assignment in seaport container terminals. We propose a model based on an exponential number of variables that is solved via column generation. An exact branch and pric ...

Informs2013

To Convexify or Not? Regression with Clustering Penalties on Graphs

Volkan Cevher, Luca Baldassarre, Marwa El Halabi

We consider minimization problems that are compositions of convex functions of a vector

\x \in\reals^N

with submodular set functions of its support (i.e., indices of the non-zero coefficients of

\x

). Such problems are in general difficult for large

N

...

IEEE2013

Tracklet-based Multi-Commodity Network Flow for Tracking Multiple People

Pascal Fua, François Fleuret, Jérôme Berclaz, Horesh Beny Ben Shitrit

(EN)A method for continuously tracking multiple people partitioned into groups while preserving identities under global appearance constraints, wherein people's trajectories may intersect, and wherein only sparse appearance information is available is disc ...

WO2013

Regularized Bundle Methods for Convex and Non-Convex Risks

Machine learning is most often cast as an optimization problem. Ideally, one expects a convex objective function to rely on efficient convex optimizers with nice guarantees such as no local optima. Yet, non-convexity is very frequent in practice and it may ...

2012

A Spatial Branch and Bound Algorithm for Continuous Pricing with Advanced Discrete Choice Demand Modeling

Graph Chatbot

Chat with Graph Search

Time-Optimal Path Following for Robots With Convex-Concave Constraints Using Sequential Convex Programming

Design and operations of gas transmission networks

A convex optimization approach for image recovery from nonlinear measurements in optical interferometry

Convex computation of the region of attraction of polynomial control systems

Energy-Efficient Opportunistic Collaborative Sensing

Non-convex optimization for robust multi-view imaging

An exact algorithm for the integrated planning of berth allocation and quay crane assignment

To Convexify or Not? Regression with Clustering Penalties on Graphs

Tracklet-based Multi-Commodity Network Flow for Tracking Multiple People

Regularized Bundle Methods for Convex and Non-Convex Risks

Time-Optimal Path Following for Robots With Convex-Concave Constraints Using Sequential Convex Programming

Regularized Bundle Methods for Convex and Non-Convex Risks

An exact algorithm for the integrated planning of berth allocation and quay crane assignment

Design and operations of gas transmission networks

Convex computation of the region of attraction of polynomial control systems

Energy-Efficient Opportunistic Collaborative Sensing

To Convexify or Not? Regression with Clustering Penalties on Graphs

Tracklet-based Multi-Commodity Network Flow for Tracking Multiple People

Non-convex optimization for robust multi-view imaging

A convex optimization approach for image recovery from nonlinear measurements in optical interferometry