Specialized fast algorithms for IQC feasibility and optimization problems.

DOI10.1016/J.AUTOMATICA.2003.09.016zbMATH Open1034.93021OpenAlexW2062571764MaRDI QIDQ1428693FDOQ1428693

A. Megretski, Ulf T. Jönsson, Chung-Yao Kao

Publication date: 29 March 2004

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.automatica.2003.09.016

Recommendations

• Algorithms for the quasiconvex feasibility problem
• Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
• Optimal iterative QP and QPQC algorithms
• Analysis and design of optimization algorithms via integral quadratic constraints
• A sequential quadratic optimization algorithm with rapid infeasibility detection
• Optimal quadratic programming algorithms. With applications to variational inequalities
• Applications of accelerated computational methods for quasi-nonexpansive operators to optimization problems
• Feasibility and infeasibility in optimization. Algorithms and computational methods.
• An algorithm for computationally expensive engineering optimization problems

zbMATH Keywords

Stability analysisSemidefinite programmingCutting plane methodIntegral quadratic constraintPositive real lemma

Mathematics Subject Classification ID

Semidefinite programming (90C22) Asymptotic stability in control theory (93D20)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Semidefinite Programming
• Dissipative dynamical systems. I: General theory
• Title not available (Why is that?)
• Geometric algorithms and combinatorial optimization.
• On the Kalman-Yakubovich-Popov lemma
• Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
• A cutting plane method from analytic centers for stochastic programming
• Title not available (Why is that?)
• Decomposition and Nondifferentiable Optimization with the Projective Algorithm
• System analysis via integral quadratic constraints
• Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• A multiloop generalization of the circle criterion for stability margin analysis
• A cutting plane algorithm for convex programming that uses analytic centers
• A Potential Reduction Algorithm Allowing Column Generation
• Title not available (Why is that?)
• Multiple cuts in the analytic center cutting plane method
• Complexity estimates of some cutting plane methods based on the analytic barrier
• Complexity analysis of the analytic center cutting plane method that uses multiple cuts
• Cutting planes and column generation techniques with the projective algorithm
• Title not available (Why is that?)
• Shallow, deep and very deep cuts in the analytic center cutting plane method.
• A two-cut approach in the analytic center cutting plane method
• Primal-dual-infeasible Newton approach for the analytic center deep-cutting plane method

Cited In (10)

• Time domain interpretations of frequency domain inequalities on (semi)finite ranges
• IQC analysis and synthesis via nonsmooth optimization
• Sampling method for semidefinite programmes with non-negative Popov function constraints
• Low-rank exploitation in semidefinite programming for control
• Robust stability and performance analysis based on integral quadratic constraints
• A cutting plane method for solving KYP-SDPs
• A decomposition algorithm for KYP-SDPs
• An oracle for the discrete-time integral quadratic constraint problem
• Design and robustness analysis of fighter aircraft flight control laws
• Systems with sector bound nonlinearities: a behavioral approach

Uses Software

• ACCPM
• Mu Analysis and Synthesis Toolbox
• QDES

This page was built for publication: Specialized fast algorithms for IQC feasibility and optimization problems.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1428693)