Specialized fast algorithms for IQC feasibility and optimization problems.
type: Item
instance of: scholarly article
title: Specialized fast algorithms for IQC feasibility and optimization problems.
zbMATH Open document ID: 1034.93021
author: Chung-Yao Kao
author: A. Megretski
author: Ulf T. Jönsson
published in: Automatica
publication date: 2004-03-29T00:00:00Z
Mathematics Subject Classification ID: 93B40
Mathematics Subject Classification ID: 93D20
Mathematics Subject Classification ID: 90C22
zbMATH DE Number: 2062919
zbMATH Keywords: Integral quadratic constraint
zbMATH Keywords: Cutting plane method
zbMATH Keywords: Semidefinite programming
zbMATH Keywords: Stability analysis
zbMATH Keywords: Positive real lemma
describes a project that uses: ACCPM
describes a project that uses: QDES
describes a project that uses: Mu Analysis and Synthesis Toolbox
MaRDI profile type: Publication
full work available at URL: j.automatica.2003.09.016
OpenAlex ID: W2062571764
cites work: Q3342208
cites work: A cutting plane algorithm for convex programming that uses analytic centers
cites work: A cutting plane method from analytic centers for stochastic programming
cites work: Q4003797
cites work: Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
cites work: Decomposition and Nondifferentiable Optimization with the Projective Algorithm
cites work: Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
cites work: Primal-dual-infeasible Newton approach for the analytic center deep-cutting plane method
cites work: Cutting planes and column generation techniques with the projective algorithm
cites work: Shallow, deep and very deep cuts in the analytic center cutting plane method.
cites work: A two-cut approach in the analytic center cutting plane method
cites work: Multiple cuts in the analytic center cutting plane method
cites work: Geometric algorithms and combinatorial optimization.
cites work: Q3050157
cites work: System analysis via integral quadratic constraints
cites work: Complexity estimates of some cutting plane methods based on the analytic barrier
cites work: Q4324980
cites work: On the Kalman-Yakubovich-Popov lemma
cites work: A multiloop generalization of the circle criterion for stability margin analysis
cites work: Semidefinite Programming
cites work: Dissipative dynamical systems. I: General theory
cites work: Q5593626
cites work: Q5537895
cites work: A Potential Reduction Algorithm Allowing Column Generation
cites work: Complexity analysis of the analytic center cutting plane method that uses multiple cuts
cites work: Q4382667
cites work: Q3128879
DOI: 10.1016/J.AUTOMATICA.2003.09.016
Recommended article: Algorithms for the quasiconvex feasibility problem
Recommended article: Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
Recommended article: Optimal iterative QP and QPQC algorithms
Recommended article: Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints
Recommended article: A Sequential Quadratic Optimization Algorithm with Rapid Infeasibility Detection
Recommended article: Optimal quadratic programming algorithms. With applications to variational inequalities
Recommended article: Applications of accelerated computational methods for quasi-nonexpansive operators to optimization problems
Recommended article: Feasibility and infeasibility in optimization. Algorithms and computational methods.
Recommended article: An algorithm for computationally expensive engineering optimization problems
description: scientific article; zbMATH DE number 2062919