Sequential quadratic programming

Formal sciences
Theoretical computer science
Algorithms and data structures
Combinatorial optimization

About
Privacy
Disclaimer

Graph Chatbot

Related publications (28)

Adaptive data augmentation for image classification

Pascal Frossard, Alhussein Fawzi

Data augmentation is the process of generating samples by transforming training data, with the target of improving the accuracy and robustness of classifiers. In this paper, we propose a new automatic and adaptive algorithm for choosing the transformations ...

IEEE2016

Interactive design exploration for constrained meshes

Mark Pauly, Sofien Bouaziz, Bailin Deng, Yuliy Gennadievich Schwartzburg, Mario Moacir Deuss, Alexandre Kaspar

In architectural design, surface shapes are commonly subject to geometric constraints imposed by material, fabrication or assembly. Rationalization algorithms can convert a freeform design into a form feasible for production, but often require design modif ...

2015

Distributed Rate Allocation in Inter-Session Network Coding

Pascal Frossard, Nikolaos Thomos, Eirina Bourtsoulatze

In this work, we propose a distributed rate allocation algorithm that minimizes the average decoding delay for multimedia clients in inter-session network coding systems. We consider a scenario where the users are organized in a mesh network and each user ...

Institute of Electrical and Electronics Engineers2014

Constrained convex minimization via model-based excessive gap

Volkan Cevher, Quoc Tran Dinh

We introduce a model-based excessive gap technique to analyze first-order primal- dual methods for constrained convex minimization. As a result, we construct new primal-dual methods with optimal convergence rates on the objective residual and the primal fe ...

2014

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

Quoc Tran Dinh

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

Shaped Beam Synthesis of Arrays via Sequential Convex Optimizations

Juan Ramon Mosig, Anja Skrivervik, Benjamin Fuchs

A method to synthesize shaped beams with antenna arrays is presented. Specifically, the element excitations are determined such that the array radiates a power pattern that approximates a desired shape. To efficiently solve this problem, an iterative algor ...

Ieee-Inst Electrical Electronics Engineers Inc2013

Efficient Interior Point Methods for Multistage Problems Arising in Receding Horizon Control

Colin Neil Jones, Melanie Nicole Zeilinger

Receding horizon control requires the solution of an optimization problem at every sampling instant. We present efficient interior point methods tailored to convex multistage problems, a problem class which most relevant MPC problems with linear dynamics c ...

2012

Efficient Interior Point Methods for Multistage Problems Arising in Receding Horizon Control

Colin Neil Jones, Melanie Nicole Zeilinger

2012

Page 2 of 2