A cutting plane method for solving KYP-SDPs
From MaRDI portal
Publication:2440612
DOI10.1016/j.automatica.2007.06.026zbMath1283.90028MaRDI QIDQ2440612
Publication date: 19 March 2014
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2007.06.026
90C22: Semidefinite programming
Related Items
Sampling method for semidefinite programmes with non-negative Popov function constraints, Co-design of linear systems using generalized Benders decomposition, A decomposition algorithm for KYP-SDPs, Induced \(\mathcal{L}_2\)-gain computation for rational LPV systems using Finsler's lemma and minimal generators, An oracle for the discrete-time integral quadratic constraint problem, Low-rank exploitation in semidefinite programming for control
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Using central prices in the decomposition of linear programs
- Cutting planes and column generation techniques with the projective algorithm
- Newton's method for convex programming and Tschebyscheff approximation
- Primal-dual-infeasible Newton approach for the analytic center deep-cutting plane method
- A two-cut approach in the analytic center cutting plane method
- Complexity analysis of the analytic center cutting plane method that uses multiple cuts
- Convex optimization problems involving finite autocorrelation sequences
- Specialized fast algorithms for IQC feasibility and optimization problems.
- Shallow, deep and very deep cuts in the analytic center cutting plane method.
- A new algorithm for minimizing convex functions over convex sets
- Multiple Cuts in the Analytic Center Cutting Plane Method
- Lectures on Modern Convex Optimization
- The Cutting-Plane Method for Solving Convex Programs
- A Schur method for solving algebraic Riccati equations
- A Generalized Eigenvalue Approach for Solving Riccati Equations
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- A Potential Reduction Algorithm Allowing Column Generation
- A central cutting plane algorithm for the convex programming problem
- Linear Matrix Inequalities in System and Control Theory
- System analysis via integral quadratic constraints
- Optimization Problems over Positive Pseudopolynomial Matrices
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Efficient computation of a guaranteed lower bound on the robust stability margin for a class of uncertain systems
- Interior-Point Algorithms for Semidefinite Programming Problems Derived from the KYP Lemma
- Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
- Semidefinite programming duality and linear time-invariant systems
