Optimisation SDP

Science formelle
Informatique théorique
Algorithme
Optimisation combinatoire

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (30)

Scalable Semidefinite Programming

Volkan Cevher, Alp Yurtsever

Semidefinite programming (SDP) is a powerful framework from convex optimization that has striking potential for data science applications. This paper develops a provably correct algorithm for solving large SDP problems by economizing on both the storage an ...

2021

Implications of ANEC for SCFTs in four dimensions

Andrea Manenti, Alessandro Vichi

We explore consequences of the Averaged Null Energy Condition (ANEC) for scaling dimensions Delta of operators in four-dimensional N = 1 superconformal field theories. We show that in many cases the ANEC bounds are stronger than the corresponding unitarity ...

Springer Nature2020

Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms

Ola Nils Anders Svensson, Ashkan Norouzi Fard, Justin Dean Ward

Clustering is a classic topic in optimization with k-means being one of the most fundamental such problems. In the absence of any restrictions on the input, the best-known algorithm for k-means in Euclidean space with a provable guarantee is a simple local ...

SIAM PUBLICATIONS2020

Conditional gradient methods for stochastically constrained convex minimization

Volkan Cevher, Ya-Ping Hsieh, Ahmet Alacaoglu, Maria-Luiza Vladarean

We propose two novel conditional gradient-based methods for solving structured stochastic convex optimization problems with a large number of linear constraints. Instances of this template naturally arise from SDP-relaxations of combinatorial problems, whi ...

2020

Topology-Finding of Tensegrity Structures Considering Global Stability Condition

Yafeng Wang

This study proposes a general framework for topology-finding or topology optimization of tensegrity structures. The existing topology-finding formulation of tensegrity structures based on mixed-integer linear programming (MILP) was improved and transformed ...

2020

Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma

Friedrich Eisenbrand

We consider integer programming problems in standard form max{c(T)x : Ax = b, x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m), and c is an element of Z(n). We show that such an integer program can be solved in time ...

ASSOC COMPUTING MACHINERY2020

Scalable Stochastic Optimization: Scenario Reduction with Guarantees

Kilian Schindler

Stochastic optimization is a popular modeling paradigm for decision-making under uncertainty and has a wide spectrum of applications in management science, economics and engineering. However, the stochastic optimization models one faces in practice are int ...

EPFL2020

Controlling oscillations in high-order Discontinuous Galerkin schemes using artificial viscosity tuned by neural networks

Jan Sickmann Hesthaven, Niccolo' Discacciati, Deep Ray

High-order numerical solvers for conservation laws suffer from Gibbs phenomenon close to discontinuities, leading to spurious oscillations and a detrimental effect on the solution accuracy. A possible strategy to reduce it comprises adding a suitable amoun ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2020

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 ρ such that there exist balls of radius ρ around ...

Springer2020

Finding Second-Order Stationary Points in Constrained Minimization: A Feasible Direction Approach

Shaul Nadav Hallak

This paper introduces a method for computing points satisfying the second-order necessary optimality conditions for nonconvex minimization problems subject to a closed and convex constraint set. The method comprises two independent steps corresponding to t ...

SPRINGER/PLENUM PUBLISHERS2020

Page 2 sur 2