A cutting plane method for solving KYP-SDPs (Q2440612): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: ACCPM / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.automatica.2007.06.026 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2041882293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex optimization problems involving finite autocorrelation sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming duality and linear time-invariant systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient computation of a guaranteed lower bound on the robust stability margin for a class of uncertain systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Modern Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Matrix Inequalities in System and Control Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton's method for convex programming and Tschebyscheff approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3723176 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A central cutting plane algorithm for the convex programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization Problems over Positive Pseudopolynomial Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition and Nondifferentiable Optimization with the Projective Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using central prices in the decomposition of linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual-infeasible Newton approach for the analytic center deep-cutting plane method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting planes and column generation techniques with the projective algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shallow, deep and very deep cuts in the analytic center cutting plane method. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-cut approach in the analytic center cutting plane method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple Cuts in the Analytic Center Cutting Plane Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Specialized fast algorithms for IQC feasibility and optimization problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cutting-Plane Method for Solving Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Schur method for solving algebraic Riccati equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: System analysis via integral quadratic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: SDPT3 — A Matlab software package for semidefinite programming, Version 1.3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for minimizing convex functions over convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalized Eigenvalue Approach for Solving Riccati Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior-Point Algorithms for Semidefinite Programming Problems Derived from the KYP Lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Potential Reduction Algorithm Allowing Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity analysis of the analytic center cutting plane method that uses multiple cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128879 / rank
 
Normal rank

Latest revision as of 12:26, 7 July 2024

scientific article
Language Label Description Also known as
English
A cutting plane method for solving KYP-SDPs
scientific article

    Statements

    A cutting plane method for solving KYP-SDPs (English)
    0 references
    0 references
    0 references
    19 March 2014
    0 references
    0 references
    semidefinite programming
    0 references
    Kalman-Yakubovich-Popov lemma
    0 references
    cutting plane method
    0 references
    stability analysis
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references