Specialized fast algorithms for IQC feasibility and optimization problems.
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- scientific article; zbMATH DE number 1001726 (Why is no real title available?)
- scientific article; zbMATH DE number 3876916 (Why is no real title available?)
- scientific article; zbMATH DE number 53598 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1131479 (Why is no real title available?)
- scientific article; zbMATH DE number 3249151 (Why is no real title available?)
- scientific article; zbMATH DE number 3313235 (Why is no real title available?)
- A Potential Reduction Algorithm Allowing Column Generation
- A cutting plane algorithm for convex programming that uses analytic centers
- A cutting plane method from analytic centers for stochastic programming
- A multiloop generalization of the circle criterion for stability margin analysis
- A two-cut approach in the analytic center cutting plane method
- Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
- Complexity analysis of the analytic center cutting plane method that uses multiple cuts
- Complexity estimates of some cutting plane methods based on the analytic barrier
- Cutting planes and column generation techniques with the projective algorithm
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- Dissipative dynamical systems. I: General theory
- Geometric algorithms and combinatorial optimization.
- Multiple cuts in the analytic center cutting plane method
- On the Kalman-Yakubovich-Popov lemma
- Primal-dual-infeasible Newton approach for the analytic center deep-cutting plane method
- Semidefinite Programming
- Shallow, deep and very deep cuts in the analytic center cutting plane method.
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
- System analysis via integral quadratic constraints
Cited in
(10)- Design and robustness analysis of fighter aircraft flight control laws
- An oracle for the discrete-time integral quadratic constraint problem
- Low-rank exploitation in semidefinite programming for control
- Time domain interpretations of frequency domain inequalities on (semi)finite ranges
- Sampling method for semidefinite programmes with non-negative Popov function constraints
- Systems with sector bound nonlinearities: a behavioral approach
- A cutting plane method for solving KYP-SDPs
- Robust stability and performance analysis based on integral quadratic constraints
- A decomposition algorithm for KYP-SDPs
- IQC analysis and synthesis via nonsmooth optimization
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)
