Publications related to Semidefinite programming

Frequency-domain data-driven position-dependent controller synthesis for Cartesian Robots

Alireza Karimi, Philippe Louis Schuchert

Cartesian robots have position-dependent dynamics that should be accounted for in high performance applications. Traditional methods design Linear Time Invariant (LTI) controllers which are robustly stable with respect to position variations, but require a ...

2022

On The Convergence Of Stochastic Primal-Dual Hybrid Gradient

Volkan Cevher, Ahmet Alacaoglu

In this paper, we analyze the recently proposed stochastic primal-dual hybrid gradient (SPDHG) algorithm and provide new theoretical results. In particular, we prove almost sure convergence of the iterates to a solution with convexity and linear convergenc ...

SIAM PUBLICATIONS2022

A convex set of robust D—stabilizing controllers using Cauchy's argument principle

Alireza Karimi, Philippe Louis Schuchert

A new approach is presented to obtain a convex set of robust D—stabilizing fixed structure controllers, relying on Cauchy's argument principle. A convex set of D—stabilizing controllers around an initial D—stabilizing controller for a multi-model set is re ...

Elsevier2022

Information Retrieval Under Network Uncertainty: Robust Internet Ranking

Ralf Seifert, Anna Timonina-Farkas

Internet ranking algorithms play a crucial role in information technologies and numerical analysis due to their efficiency in high dimensions and wide range of possible applications, including scientometrics and systemic risk in finance (SinkRank, DebtRank ...

INFORMS2022

An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity

Volkan Cevher, Alp Yurtsever

This paper develops a new storage-optimal algorithm that provably solves almost all semidefinite programs (SDPs). This method is particularly effective for weakly constrained SDPs under appropriate regularity conditions. The key idea is to formulate an app ...

SIAM PUBLICATIONS2021

Form-finding of tensegrity structures via rank minimization of force density matrix

Yafeng Wang

This study proposes a general computational framework for the form-finding of tensegrity structures. The procedure is divided into two stages in which the member force densities and nodal coordinates are obtained respectively. In the first stage, the deter ...

ELSEVIER SCI LTD2021

Fast Projection Onto Convex Smooth Constraints

Maryam Kamgarpour, Andreas Krause, Ilnura Usmanova

The Euclidean projection onto a convex set is an important problem that arises in numerous constrained optimization tasks. Unfortunately, in many cases, computing projections is computationally demanding. In this work, we focus on projection problems where ...

PMLR2021

A first-order primal-dual method with adaptivity to local smoothness

Volkan Cevher, Maria-Luiza Vladarean

We consider the problem of finding a saddle point for the convex-concave objective

\min_x \max_y f(x) + \langle Ax, y\rangle - g^*(y)

, where

f

is a convex function with locally Lipschitz gradient and

g

is convex and possibly non-smooth. We propose an ...

2021

Fair colorful k-center clustering

Ola Nils Anders Svensson, Xinrui Jia

An instance of colorful k-center consists of points in a metric space that are colored red or blue, along with an integer k and a coverage requirement for each color. The goal is to find the smallest radius rho such that there exist balls of radius rho aro ...

SPRINGER HEIDELBERG2021

A unifying framework for form-finding and topology-finding of tensegrity structures

Yafeng Wang

This paper presents a unifying framework for the form-finding and topology-finding of tensegrity structures. The novel computational framework is based on rank-constrained linear matrix inequalities. For form-finding, given the topology (i.e., member conne ...

PERGAMON-ELSEVIER SCIENCE LTD2021

Semidefinite programming

Graph Chatbot

Chat with Graph Search

Frequency-domain data-driven position-dependent controller synthesis for Cartesian Robots

On The Convergence Of Stochastic Primal-Dual Hybrid Gradient

A convex set of robust D—stabilizing controllers using Cauchy's argument principle

Information Retrieval Under Network Uncertainty: Robust Internet Ranking

An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity

Form-finding of tensegrity structures via rank minimization of force density matrix

Fast Projection Onto Convex Smooth Constraints

A first-order primal-dual method with adaptivity to local smoothness

Fair colorful k-center clustering

A unifying framework for form-finding and topology-finding of tensegrity structures

On The Convergence Of Stochastic Primal-Dual Hybrid Gradient

Form-finding of tensegrity structures via rank minimization of force density matrix

Information Retrieval Under Network Uncertainty: Robust Internet Ranking

An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity

Fast Projection Onto Convex Smooth Constraints

Fair colorful k-center clustering

A first-order primal-dual method with adaptivity to local smoothness

A unifying framework for form-finding and topology-finding of tensegrity structures

Frequency-domain data-driven position-dependent controller synthesis for Cartesian Robots

A convex set of robust D—stabilizing controllers using Cauchy's argument principle