Publications related to Computational Complexity Certification for Real-Time MPC With Input Constraints Based on the Fast Gradient Method

Fast Proximal algorithms for Self-concordant function minimization with application to sparse graph selection

The convex

\ell_1

-regularized

\log\det

divergence criterion has been shown to produce theoretically consistent graph learning. However, this objective function is challenging since the

\ell_1

-regularization is nonsmooth, the

\log\det

objective is n ...

2013

Fast Proximal Algorithms For Self-Concordant Function Minimization With Application To Sparse Graph Selection

Volkan Cevher, Anastasios Kyrillidis

The convex l(1)-regularized log det divergence criterion has been shown to produce theoretically consistent graph learning. However, this objective function is challenging since the l(1)-regularization is nonsmooth, the log det objective is not globally Li ...

IEEE2013

Certification Aspects of the Fast Gradient Method for Solving the Dual of Parametric Convex Programs

Colin Neil Jones

This paper examines the computational complexity certification of the fast gradient method for the solution of the dual of a parametric con- vex program. To this end, a lower iteration bound is derived such that for all parameters from a compact set a solu ...

Springer Heidelberg2012

Numerical methods for multilattices

Assyr Abdulle, Alexander Shapeev

Among the efficient numerical methods based on atomistic models, the quasi-continuum (QC) method has attracted growing interest in recent years. The QC method was first developed for crystalline materials with Bravais lattice and was later extended to mult ...

Siam Publications2012

Voltage Propagation Method for 3-D Power Grid Analysis

Giovanni De Micheli, Vasileios Pavlidis, Cheng Zhang

Power grid analysis is a challenging problem for mod- ern integrated circuits. For 3-D systems fabricated using stacked tiers with TSVs, traditional power grid analysis methods for pla- nar (2-D) circuits do not demonstrate the same performance. An efficie ...

2012

Run-to-Run MPC Tuning via Gradient Descent

Dominique Bonvin, Grégory François, Gene Bunin

A gradient-descent method for the run-to-run tuning of MPC controllers is proposed. It is shown that, with an assumption on process repeatability, the MPC tuning parameters may be brought to a locally optimal set. SISO and MIMO examples illustrate the char ...

Elsevier2012

A Recursive Acceleration Technique for Static Potential Green's Functions of a Rectangular Cavity Combining Image and Modal Series

Juan Ramon Mosig, Michael Mattes, Sergio Lopez Pena

A hybrid acceleration algorithm for the computation of the static potential Green’s functions of a rectangular cavity is proposed. Similarly to Ewald’s method, it combines the series expansions in terms of images and modes. The main particularity with resp ...

Institute of Electrical and Electronics Engineers2011

Direct data-driven H2 − H∞ loop-shaping

Alireza Karimi

In this paper, a direct data-driven approach is proposed to tune fixed-order controllers for unknown stable LTI plants in a mixed-sensitivity loop-shaping problem. The method requires a single set of input-output samples and it is based on simple convex op ...

2011

Optimization Problem Coupled with Differential Equations: A Numerical Algorithm Mixing an Interior-Point Method and Event Detection

Jacques Rappaz, Alexandre Caboussat, Christian Landry

The numerical analysis of a dynamic constrained optimization problem is presented. It consists of a global minimization problem that is coupled with a system of ordinary differential equations. The activation and the deactivation of inequality constraints ...

2010

Contour parallel milling tool path generation for arbitrary pocket shape using a fast marching method

Paul Xirouchakis, Sandeep Dhanik

Contour parallel tool paths are among the most widely used tool paths for planer milling operations. A number of exact as well as approximate methods are available for offsetting a closed boundary in order to generate a contour parallel tool path; however, ...

Springer-Verlag2010

Computational Complexity Certification for Real-Time MPC With Input Constraints Based on the Fast Gradient Method

Graph Chatbot

Chat with Graph Search

Fast Proximal algorithms for Self-concordant function minimization with application to sparse graph selection

Fast Proximal Algorithms For Self-Concordant Function Minimization With Application To Sparse Graph Selection

Certification Aspects of the Fast Gradient Method for Solving the Dual of Parametric Convex Programs

Numerical methods for multilattices

Voltage Propagation Method for 3-D Power Grid Analysis

Run-to-Run MPC Tuning via Gradient Descent

A Recursive Acceleration Technique for Static Potential Green's Functions of a Rectangular Cavity Combining Image and Modal Series

Direct data-driven H2 − H∞ loop-shaping

Optimization Problem Coupled with Differential Equations: A Numerical Algorithm Mixing an Interior-Point Method and Event Detection

Contour parallel milling tool path generation for arbitrary pocket shape using a fast marching method

Numerical methods for multilattices

Optimization Problem Coupled with Differential Equations: A Numerical Algorithm Mixing an Interior-Point Method and Event Detection

Direct data-driven H2 − H∞ loop-shaping

A Recursive Acceleration Technique for Static Potential Green's Functions of a Rectangular Cavity Combining Image and Modal Series

Contour parallel milling tool path generation for arbitrary pocket shape using a fast marching method

Certification Aspects of the Fast Gradient Method for Solving the Dual of Parametric Convex Programs

Run-to-Run MPC Tuning via Gradient Descent

Voltage Propagation Method for 3-D Power Grid Analysis

Fast Proximal algorithms for Self-concordant function minimization with application to sparse graph selection

Fast Proximal Algorithms For Self-Concordant Function Minimization With Application To Sparse Graph Selection