Time-Varying Semidefinite Programs
From MaRDI portal
Publication:4958555
DOI10.1287/moor.2020.1117zbMath1477.90054arXiv1808.03994OpenAlexW3158310418MaRDI QIDQ4958555
Bachir El Khadir, Amir Ali Ahmadi
Publication date: 14 September 2021
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.03994
semidefinite programmingpositivstellensatzbiobjective optimizationcontinuous linear programsunivariate polynomial matricestime-varying convex optimization
Related Items (2)
Time-Varying Semidefinite Programming: Path Following a Burer–Monteiro Factorization ⋮ Tighter bounds on transient moments of stochastic chemical systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some applications of polynomial optimization in operations research and real-time decision making
- A simplex based algorithm to solve separated continuous linear programs
- Matrix measures, moment spaces and Favard's theorem for the interval \([0,1\) and \([0,\infty)\)]
- Semidefinite programming relaxations for semialgebraic problems
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Approximating the Pareto set of multiobjective linear programs via robust optimization
- Approximating Pareto curves using semidefinite relaxations
- The wireless network jamming problem
- Jamming communication networks under complete uncertainty
- A class of continuous linear programming problems
- Continuous programming. I: Linear objectives
- Global Optimization with Polynomials and the Problem of Moments
- A Complete Characterization of the Gap between Convexity and SOS-Convexity
- Semidefinite Characterization of Sum-of-Squares Cones in Algebras
- Polynomial Approximations for Continuous Linear Programs
- A “Joint+Marginal” Approach to Parametric Polynomial Optimization
- Separated Continuous Conic Programming: Strong Duality and an Approximation Algorithm
- A continuous-time network simplex algorithm
- A New Algorithm for State-Constrained Separated Continuous Linear Programs
- An Algorithm for a Class of Continuous Linear Programs
- Convergence of a General Class of Algorithms for Separated Continuous Linear Programs
- Sum-of-Squares Optimization without Semidefinite Programming
- Forms of Optimal Solutions for Separated Continuous Linear Programs
- A Duality Theory for Separated Continuous Linear Programs
- A Hierarchy of Near-Optimal Policies for Multistage Adaptive Optimization
- Semi-Infinite Programming using High-Degree Polynomial Interpolants and Semidefinite Programming
- Efficient Algorithms for Separated Continuous Linear Programs: The Multicommodity Flow Problem with Holding Costs and Extensions
- An Extended Duality Theorem for Continuous Linear Programming Problems
- A Duality Theorem for a Class of Continuous Linear Programming Problems
- Numerical solutions to continuous linear programming problems
- Bottleneck Problems and Dynamic Programming
- Positive polynomials on compact sets
This page was built for publication: Time-Varying Semidefinite Programs
