SDPT3 — A Matlab software package for semidefinite programming, Version 1.3

From MaRDI portal

Publication:4504792

Jump to:navigation, search

DOI10.1080/10556789908805762zbMath0997.90060OpenAlexW1999913571WikidataQ29028549 ScholiaQ29028549MaRDI QIDQ4504792

Michael J. Todd, Kim-Chuan Toh, Reha H. Tütüncü

Publication date: 6 December 2000

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556789908805762

zbMATH Keywords

Matlab software package semidefinite programs path-following algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Packaged methods for numerical algorithms (65Y15)

Related Items

Robustness analysis of uncertain discrete‐time systems with dissipation inequalities and integral quadratic constraints ⋮ The numerics of phase retrieval ⋮ Switching fuzzy modelling and control scheme using T-S fuzzy systems with nonlinear consequent parts ⋮ Unnamed Item ⋮ Sliding mode stabilisation of networked systems with consecutive data packet dropouts using only accessible information ⋮ Not-Post-Peierls compatibility under noisy channels ⋮ Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints ⋮ Bilevel Polynomial Programs and Semidefinite Relaxation Methods ⋮ A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms ⋮ Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks ⋮ A stabilized sequential quadratic semidefinite programming method for degenerate nonlinear semidefinite programs ⋮ Identifying a Set of Key Members in Social Networks Using SDP-Based Stochastic Search and Integer Programming Algorithms ⋮ Coseparable Nonnegative Matrix Factorization ⋮ Real‐time control of connected vehicles in signalized corridors using pseudospectral convex optimization ⋮ Robust observer‐based controller for uncertain‐stochastic linear parameter‐varying (LPV) system under actuator degradation ⋮ Convergences for robust bilevel polynomial programmes with applications ⋮ Conservatism reduction for linear parameter‐varying control design facing inexact scheduling parameters illustrated on flight tests ⋮ Nonlinear parameter‐varying state‐feedback design for a gyroscope using virtual control contraction metrics ⋮ A nonlinear parameter varying observer for real‐time damper force estimation of an automotive electro‐rheological suspension system ⋮ An equivalent nonlinear optimization model with triangular low-rank factorization for semidefinite programs ⋮ A semismooth Newton based dual proximal point algorithm for maximum eigenvalue problem ⋮ Fast certifiable relative pose estimation with gravity prior ⋮ Strong observability as a sufficient condition for non-singularity and lossless convexification in optimal control with mixed constraints ⋮ Semi-Infinite Programming using High-Degree Polynomial Interpolants and Semidefinite Programming ⋮ Successive Convexification for Optimal Control with Signal Temporal Logic Specifications ⋮ Solving graph equipartition SDPs on an algebraic variety ⋮ Approximation of the Shannon capacity via matrix cone programming ⋮ Solving PhaseLift by Low-Rank Riemannian Optimization Methods for Complex Semidefinite Constraints ⋮ Tridiagonal maximum-entropy sampling and tridiagonal masks ⋮ An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization ⋮ An outer-approximation algorithm for maximum-entropy sampling ⋮ A DCA-Newton method for quartic minimization over the sphere ⋮ Sum-of-squares certificates for Vizing's conjecture via determining Gröbner bases ⋮ A revised sequential quadratic semidefinite programming method for nonlinear semidefinite optimization ⋮ Tighter bounds on transient moments of stochastic chemical systems ⋮ An outer-approximation algorithm for maximum-entropy sampling ⋮ Deciding Robust Feasibility and Infeasibility Using a Set Containment Approach: An Application to Stationary Passive Gas Network Operations ⋮ An efficient algorithm for second-order cone linear complementarity problems ⋮ Towards a Mathematical Theory of Super‐resolution ⋮ Stability analysis of data-driven local model networks ⋮ A SPREAD-RETURN MEAN-REVERTING MODEL FOR CREDIT SPREAD DYNAMICS ⋮ A framework for optimal actuator/sensor selection in a control system ⋮ Application of facial reduction to H _∞ state feedback control problem ⋮ A gradient method for the monotone fused least absolute shrinkage and selection operator ⋮ Robust support vector machines for classification and computational issues ⋮ A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems ⋮ Constrained trace-optimization of polynomials in freely noncommuting variables ⋮ Approximate minimum enclosing balls in high dimensions using core-sets ⋮ Robust partial synchronization of delay-coupled networks ⋮ Chebyshev Inequalities for Products of Random Variables ⋮ Bounds on heat transfer for Bénard–Marangoni convection at infinite Prandtl number ⋮ A feasible direction algorithm for nonlinear second-order cone programs ⋮ Minimum-time speed optimisation over a fixed path ⋮ An Iterative Rank Penalty Method for Nonconvex Quadratically Constrained Quadratic Programs ⋮ Semidefinite Descriptions of the Convex Hull of Rotation Matrices ⋮ A Krylov Subspace Method for Large-Scale Second-Order Cone Linear Complementarity Problem ⋮ An Active-Set Method for Second-Order Conic-Constrained Quadratic Programming ⋮ Bounds for Deterministic and Stochastic Dynamical Systems using Sum-of-Squares Optimization ⋮ Roots of Matrices in the Study of GMRES Convergence and Crouzeix's Conjecture ⋮ Global Registration of Multiple Point Clouds Using Semidefinite Programming ⋮ Nonlinear H_∞ output feedback control with integrator for polynomial discrete‐time systems ⋮ Discussion: Latent variable graphical model selection via convex optimization ⋮ Discussion: Latent variable graphical model selection via convex optimization ⋮ Discussion: Latent variable graphical model selection via convex optimization ⋮ Discussion: Latent variable graphical model selection via convex optimization ⋮ Discussion: Latent variable graphical model selection via convex optimization ⋮ An Optimality Gap Test for a Semidefinite Relaxation of a Quadratic Program with Two Quadratic Constraints ⋮ LINEARIZED ALTERNATING DIRECTION METHOD OF MULTIPLIERS FOR SEPARABLE CONVEX OPTIMIZATION OF REAL FUNCTIONS IN COMPLEX DOMAIN ⋮ A Sufficient Condition of Optimality for the Relative Pose Problem between Cameras ⋮ A primal–dual regularized interior-point method for semidefinite programming ⋮ Variations and extension of the convex-concave procedure ⋮ Credible autocoding of convex optimization algorithms ⋮ Low-rank matrix recovery with Ky Fan 2-\(k\)-norm ⋮ Gaining or losing perspective ⋮ Convex optimization learning of faithful Euclidean distance representations in nonlinear dimensionality reduction ⋮ Role of sparsity and structure in the optimization landscape of non-convex matrix sensing ⋮ On convex quadratic programs with linear complementarity constraints ⋮ A new wide-neighborhood predictor-corrector interior-point method for semidefinite optimization ⋮ A globally convergent method for solving a quartic generalized Markowitz portfolio problem ⋮ On the non-symmetric semidefinite Procrustes problem ⋮ An interior-point algorithm for semidefinite least-squares problems. ⋮ DC semidefinite programming and cone constrained DC optimization. I: Theory ⋮ Implementation of a primal-dual method for SDP on a shared memory parallel architecture ⋮ Certifying the global optimality of quartic minimization over the sphere ⋮ Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation ⋮ A bounded degree SOS hierarchy for polynomial optimization ⋮ On gridless sparse methods for multi-snapshot direction of arrival estimation ⋮ A factorization method for completely positive matrices ⋮ Multiple window moving horizon estimation ⋮ Set-based control for disturbed piecewise affine systems with state and actuation constraints ⋮ On the numerical solution of differential linear matrix inequalities ⋮ International portfolio management with affine policies ⋮ Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures ⋮ A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme ⋮ Long-step path-following algorithm for solving symmetric programming problems with nonlinear objective functions ⋮ Homogeneous self-dual algorithms for stochastic semidefinite programming ⋮ Nonsingularity of FB system and constraint nondegeneracy in semidefinite programming ⋮ Strong delay-independent stability of linear delay systems ⋮ Discussion: Latent variable graphical model selection via convex optimization ⋮ Rejoinder: Latent variable graphical model selection via convex optimization ⋮ A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring ⋮ The tracial moment problem and trace-optimization of polynomials ⋮ Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems ⋮ A distributed model predictive control strategy for finite-time synchronization problems in multi-agent double-integrator systems ⋮ Ensemble clustering using semidefinite programming with applications ⋮ Exploiting partial correlations in distributionally robust optimization ⋮ Exact algorithms for semidefinite programs with degenerate feasible set ⋮ A note on convex relaxations for the inverse eigenvalue problem ⋮ \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM ⋮ COSMO: a conic operator splitting method for convex conic problems ⋮ Exact matrix completion based on low rank Hankel structure in the Fourier domain ⋮ Numerical algebraic geometry and semidefinite programming ⋮ ADMM for the SDP relaxation of the QAP ⋮ Positive definiteness of paired symmetric tensors and elasticity tensors ⋮ A linear-time algorithm for minimizing the ratio of quadratic functions with a quadratic constraint ⋮ Feedback design for linear control systems with input and output disturbances: a robust formulation ⋮ A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs ⋮ Conic programming: infeasibility certificates and projective geometry ⋮ The Russell measure model: computational aspects, duality, and profit efficiency ⋮ Robust hedging strategies ⋮ Explicit hard bounding functions for boundary value problems for elliptic partial differential equations ⋮ Sparse trace norm regularization ⋮ Sparsity in sums of squares of polynomials ⋮ Nonconvex min-max fractional quadratic problems under quadratic constraints: copositive relaxations ⋮ Observers for systems with nonlinearities satisfying incremental quadratic constraints ⋮ T-positive semidefiniteness of third-order symmetric tensors and T-semidefinite programming ⋮ On the quantification of aleatory and epistemic uncertainty using sliced-normal distributions ⋮ Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone ⋮ Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials ⋮ Simplified semidefinite and completely positive relaxations ⋮ Polyhedral approximations of the semidefinite cone and their application ⋮ Minimal-norm static feedbacks using dissipative Hamiltonian matrices ⋮ Sparse feedback design in discrete-time linear systems ⋮ Solving analysis problem with input and output disturbances ⋮ Feature scaling via second-order cone programming ⋮ A strategy of global convergence for the affine scaling algorithm for convex semidefinite programming ⋮ Sparsely distributed sliding mode control for interconnected systems ⋮ Exponential stabilization of sampled-data fuzzy systems via a parameterized fuzzy Lyapunov-Krasovskii functional approach ⋮ An efficient second-order cone programming approach for optimal selection in tree breeding ⋮ Minimal conic quadratic reformulations and an optimization model ⋮ A dual simplex-type algorithm for the smallest enclosing ball of balls ⋮ An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation ⋮ Mixing convex-optimization bounds for maximum-entropy sampling ⋮ Analysis of optimization algorithms via sum-of-squares ⋮ Conic relaxation approaches for equal deployment problems ⋮ An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood ⋮ Fast and robust certifiable estimation of the relative pose between two calibrated cameras ⋮ Convex programming based spectral clustering ⋮ Robust \(\mathcal{H}_\infty\) proportional-integral observer-based controller for uncertain LPV system ⋮ \(\mathrm{B}\)-subdifferentials of the projection onto the matrix simplex ⋮ Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation ⋮ Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting ⋮ Line spectrum representation for vector processes with application to frequency estimation ⋮ On convergence for hybrid models of gene regulatory networks under polytopic uncertainties: a Lyapunov approach ⋮ On the use of generalized holding devices in event-triggered observer-based controllers ⋮ An efficient numerical method for the symmetric positive definite second-order cone linear complementarity problem ⋮ Continuous-time switched systems with switching frequency constraints: path-complete stability criteria ⋮ Efficient semidefinite programming with approximate ADMM ⋮ Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning ⋮ Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space ⋮ Improved row-by-row method for binary quadratic optimization problems ⋮ T-optimal designs for multi-factor polynomial regression models via a semidefinite relaxation method ⋮ A semidefinite programming approach for the projection onto the cone of negative semidefinite symmetric tensors with applications to solid mechanics ⋮ High-probability stable Gaussian process-supported model predictive control for Lur'e systems ⋮ A global optimization method for multiple response optimization problems ⋮ Automata-based controller synthesis for stochastic systems: a game framework via approximate probabilistic relations ⋮ Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization ⋮ The density of sets avoiding distance 1 in Euclidean space ⋮ Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm ⋮ Convex graph invariant relaxations for graph edit distance ⋮ A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation ⋮ Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier ⋮ Parameter-related projection-based iterative algorithm for a kind of generalized positive semidefinite least squares problem ⋮ Optimizing over the properly efficient set of convex multi-objective optimization problems ⋮ Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data ⋮ Hybrid energy transformation to generalized Reissner-Mindlin model for laminated composite shells ⋮ Topology selection for multi-agent systems with opposite leaders ⋮ Delay-independent stability analysis of linear time-delay systems based on frequency discretization ⋮ A distributed Frank-Wolfe framework for learning low-rank matrices with the trace norm ⋮ A new gradient projection method for matrix completion ⋮ Conic optimization via operator splitting and homogeneous self-dual embedding ⋮ A second-order cone cutting surface method: Complexity and application ⋮ A simple necessary and sufficient LMI condition for the strong delay-independent stability of LTI systems with single delay ⋮ Efficient preconditioning for noisy separable nonnegative matrix factorization problems by successive projection based low-rank approximations ⋮ Conic mixed-integer rounding cuts ⋮ New algorithms for \(k\)-center and extensions ⋮ On exploiting inexact scheduling parameters for gain-scheduled control of linear parameter-varying discrete-time systems ⋮ Robust filter design for a class of uncertain systems with \(\mathcal D\) stability constraints under a unified framework ⋮ Distributionally robust optimization with matrix moment constraints: Lagrange duality and cutting plane methods ⋮ Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity ⋮ Robust stability and performance analysis based on integral quadratic constraints ⋮ New results on robust control for a class of uncertain systems and its applications to Chua's oscillator ⋮ A two-resource allocation algorithm with an application to large-scale zero-sum defensive games ⋮ Phase retrieval for imaging problems ⋮ \(H_{\infty }\) consensus of nonlinear multi-agent systems using dynamic output feedback controller: an LMI approach ⋮ Model reduction of distributed nonstationary LPV systems ⋮ Computational strategy for Russell measure in DEA: second-order cone programming ⋮ Alternating direction method of multipliers for separable convex optimization of real functions in complex variables ⋮ Robust international portfolio management ⋮ Approximation algorithms for homogeneous polynomial optimization with quadratic constraints ⋮ Motion planning for flat systems using positive B-splines: an LMI approach ⋮ Distributed control of nonstationary LPV systems over arbitrary graphs ⋮ Alternating projections on nontangential manifolds ⋮ On computing the distance to stability for matrices using linear dissipative Hamiltonian systems ⋮ Balanced truncation model reduction of nonstationary systems interconnected over arbitrary graphs ⋮ Sparsity enabled cluster reduced-order models for control ⋮ Angular synchronization by eigenvectors and semidefinite programming ⋮ CVXGEN: a code generator for embedded convex optimization ⋮ POS3POLY -- a MATLAB preprocessor for optimization with positive polynomials ⋮ An interval estimator for the unmixing of mixtures with set-based source descriptions ⋮ A first-order block-decomposition method for solving two-easy-block structured semidefinite programs ⋮ Convex quadratic relaxations for mixed-integer nonlinear programs in power systems ⋮ A semi-analytical approach for the positive semidefinite Procrustes problem ⋮ An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection ⋮ A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming ⋮ Improving an upper bound on the size of \(k\)-regular induced subgraphs ⋮ Sparse tangent portfolio selection via semi-definite relaxation ⋮ Lossless convexification of a class of optimal control problems with non-convex control constraints ⋮ Sparse approximation of functions using sums of exponentials and AAK theory ⋮ Testing the nullspace property using semidefinite programming ⋮ A low complexity semidefinite relaxation for large-scale MIMO detection ⋮ Exact simultaneous recovery of locations and structure from known orientations and corrupted point correspondences ⋮ Abstract interpretation meets convex optimization ⋮ Stochastic receding horizon control with output feedback and bounded controls ⋮ An alternating variable method for the maximal correlation problem ⋮ Location-aided routing with uncertainty in mobile ad hoc networks: a stochastic semidefinite programming approach ⋮ Robust portfolio optimization: a conic programming approach ⋮ Robust least square semidefinite programming with applications ⋮ Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint ⋮ On real-time robust model predictive control ⋮ Lossless convexification of non-convex optimal control problems for state constrained linear systems ⋮ Suspended load path tracking control using a tilt-rotor UAV based on zonotopic state estimation ⋮ Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods ⋮ Exploiting equalities in polynomial programming ⋮ On local convexity of quadratic transformations ⋮ Construction of an optimal background profile for the Kuramoto-Sivashinsky equation using semidefinite programming ⋮ A partial proximal point algorithm for nuclear norm regularized matrix least squares problems ⋮ Learning semidefinite regularizers ⋮ Robust observed-state feedback design for discrete-time systems rational in the uncertainties ⋮ On reduced semidefinite programs for second order moment bounds with applications ⋮ Noise covariance identification for nonlinear systems using expectation maximization and moving horizon estimation ⋮ Norm bounds and underestimators for unconstrained polynomial integer minimization ⋮ A polynomial primal-dual affine scaling algorithm for symmetric conic optimization ⋮ Robust multi-view \(L_2\) triangulation via optimal inlier selection and 3D structure refinement ⋮ Model reduction of homogeneous-in-the-state bilinear systems with input constraints ⋮ Convergence of fixed-point continuation algorithms for matrix rank minimization ⋮ Semidefinite programming for discrete optimization and matrix completion problems ⋮ Extension of smoothing Newton algorithms to solve linear programming over symmetric cones ⋮ A semidefinite programming study of the Elfving theorem ⋮ Optimal selection of reduced rank estimators of high-dimensional matrices ⋮ Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming ⋮ Minimal condition number for positive definite Hankel matrices using semidefinite programming ⋮ A globally convergent non-interior point algorithm with full Newton step for second-order cone programming ⋮ Fast Algorithms for Large-Scale Generalized Distance Weighted Discrimination ⋮ Latent variable graphical model selection via convex optimization ⋮ Conditional minimum volume ellipsoid with application to multiclass discrimination ⋮ A simple prior-free method for non-rigid structure-from-motion factorization ⋮ Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints ⋮ Block splitting for distributed optimization ⋮ Polynomial-sized semidefinite representations of derivative relaxations of spectrahedral cones ⋮ SDPT3 ⋮ Accurate time delay estimation based passive localization ⋮ Similarity and other spectral relations for symmetric cones ⋮ On the robustness and scalability of semidefinite relaxation for optimal power flow problems ⋮ Exploiting special structure in semidefinite programming: a survey of theory and applications ⋮ Applications of semidefinite programming ⋮ Primal recovery from consensus-based dual decomposition for distributed convex optimization ⋮ Advances in computational Lyapunov analysis using sum-of-squares programming ⋮ Generalizations of the field of values useful in the study of polynomial functions of a matrix ⋮ A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems ⋮ On the Heavy-Tail Behavior of the Distributionally Robust Newsvendor ⋮ Riemannian Trust-Region Method for the Maximal Correlation Problem ⋮ Exact dual semi-definite programs for affinely adjustable robust SOS-convex polynomial optimization problems ⋮ Identifying small mean-reverting portfolios ⋮ Sparse Representation for Sampled-Data $$H^\infty $$ Filters ⋮ Phaselift is robust to a constant fraction of arbitrary errors ⋮ The Random QUBO ⋮ A method for weighted projections to the positive definite cone ⋮ Sharper and Simpler Nonlinear Interpolants for Program Verification ⋮ Fast implementation for semidefinite programs with positive matrix completion ⋮ Finding graph embeddings by incremental low-rank semidefinite programming ⋮ Semidefinite programming for uncertain linear equations in static analysis of structures ⋮ Euclidean Distance Bounds for Linear Matrix Inequalities Analytic Centers Using a Novel Bound on the Lambert Function ⋮ The minimum gain lemma ⋮ A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives ⋮ Results selection diversity for web image retrieval ⋮ Complexity Analysis of a Sampling-Based Interior Point Method for Convex Optimization ⋮ Solving polynomial least squares problems via semidefinite programming relaxations ⋮ A successive SDP-NSDP approach to a robust optimization problem in finance ⋮ Linear matrix inequalities in control systems with uncertainty ⋮ Finding the extreme Z-eigenvalues of tensors via a sequential semidefinite programming method ⋮ Some investigations on convergence of GMRES in solving BEM equations for slender beam structures ⋮ A barrier function approach to finite-time stochastic system verification and control ⋮ Derivative feedback control of nonlinear systems with uncertain equilibrium states and actuator constraints ⋮ Simultaneous Diagonalization via Congruence of Hermitian Matrices: Some Equivalent Conditions and a Numerical Solution ⋮ On the approximation of unbounded convex sets by polyhedra ⋮ Moment and polynomial bounds for ruin-related quantities in risk theory ⋮ Long-step path-following algorithm for quantum information theory: some numerical aspects and applications ⋮ Sums of squares polynomial program reformulations for adjustable robust linear optimization problems with separable polynomial decision rules ⋮ Bounding Stationary Averages of Polynomial Diffusions via Semidefinite Programming ⋮ Matrix-Free Convex Optimization Modeling ⋮ Automated machine learning can classify bound entangled states with tomograms ⋮ Compressed sensing of low-rank plus sparse matrices ⋮ Complexity of the primal–dual path-following algorithms for the weighted determinant maximization problems with linear matrix inequalities in the narrow neighbourhood ⋮ Difference of convex algorithms for bilevel programs with applications in hyperparameter selection ⋮ Hybrid Jacobian and Gauss--Seidel Proximal Block Coordinate Update Methods for Linearly Constrained Convex Programming ⋮ Bounds for Random Binary Quadratic Programs ⋮ Finding Planted Subgraphs with Few Eigenvalues using the Schur--Horn Relaxation ⋮ Two-stage distributionally robust optimization model for warehousing-transportation problem under uncertain environment ⋮ On the balanced truncation and coprime factors reduction of Markovian jump linear systems ⋮ A cutting plane method for solving KYP-SDPs ⋮ Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints ⋮ Parameter Selection and Preconditioning for a Graph Form Solver ⋮ Semidefinite relaxations for semi-infinite polynomial programming ⋮ Sum-of-Squares Optimization without Semidefinite Programming ⋮ A paradox in bosonic energy computations via semidefinite programming relaxations ⋮ Exact solvability, non-integrability, and genuine multipartite entanglement dynamics of the Dicke model ⋮ Linear Temporal Logic Satisfaction in Adversarial Environments Using Secure Control Barrier Certificates ⋮ Convex Optimization for Finite-Horizon Robust Covariance Control of Linear Stochastic Systems ⋮ Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension ⋮ Finding the Nearest Positive-Real System ⋮ Model predictive control design for polytopic uncertain systems by synthesising multi-step prediction scenarios ⋮ Memory-Efficient Structured Convex Optimization via Extreme Point Sampling ⋮ Nonstationary LPV control for trajectory tracking: a double pendulum example ⋮ FOM – a MATLAB toolbox of first-order methods for solving convex optimization problems ⋮ Fixed-orderH_∞controller design for systems with ellipsoidal parametric uncertainty ⋮ On the Simplicity and Conditioning of Low Rank Semidefinite Programs ⋮ An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity ⋮ Smoothing and Regularization for Mixed-Integer Second-Order Cone Programming with Applications in Portfolio Optimization ⋮ Distributed control of linear time‐varying systems interconnected over arbitrary graphs ⋮ A semidefinite programming heuristic for quadratic programming problems with complementarity constraints ⋮ Second order cone programming relaxation of nonconvex quadratic optimization problems ⋮ Fixed‐Structure ℋ_∞ Controller Design for Systems with Polytopic Uncertainty: An <scp>LMI</scp> Solution ⋮ Implementation of interior point methods for mixed semidefinite and second order cone optimization problems ⋮ Robust classification and regression using support vector machines ⋮ Unnamed Item ⋮ Graph Implementations for Nonsmooth Convex Programs ⋮ ON THE CONVERGENCE RATE OF THE ALTERNATING DIRECTION METHOD OF MULTIPLIERS IN A COMPLEX DOMAIN ⋮ A semidefinite programming based polyhedral cut and price approach for the maxcut problem ⋮ Fixed-structure LPV discrete-time controller design with inducedl₂-norm andH2performance ⋮ Fixed-structure ℋ2 controller design for polytopic systems via LMIs ⋮ Active Postmarketing Drug Surveillance for Multiple Adverse Events ⋮ Optimal current waveforms for brushless permanent magnet motors ⋮ H ∞ Control of Commensurate Fractional Order Models ⋮ Best Nonnegative Rank-One Approximations of Tensors ⋮ Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts ⋮ Latest Developments in the SDPA Family for Solving Large-Scale SDPs ⋮ On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0 ⋮ New Upper Bounds for Equiangular Lines by Pillar Decomposition ⋮ Phase recovery, MaxCut and complex semidefinite programming ⋮ Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting ⋮ Parametric analysis of semidefinite optimization ⋮ Preprocessing sparse semidefinite programs via matrix completion ⋮ Adaptive control design with S-variable LMI approach for robustness and L₂ performance ⋮ A projected gradient method for optimization over density matrices ⋮ A robust model predictive control algorithm for incrementally conic uncertain/nonlinear systems ⋮ Fixed-order robust H∞ control and control-oriented uncertainty set shaping for systems with ellipsoidal parametric uncertainty ⋮ MIMO PID tuning via iterated LMI restriction ⋮ SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0) ⋮ Simplex-type algorithm for second-order cone programmes via semi-infinite programming reformulation ⋮ An alternating direction method for solving convex nonlinear semidefinite programming problems ⋮ Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties ⋮ Scalable Semidefinite Programming ⋮ A semidefinite optimization approach for the single-row layout problem with unequal dimensions ⋮ LFTB: an efficient algorithm to bound linear fractional transformations ⋮ Event-triggered H_∞ control for discrete-time piecewise affine systems with norm-bounded uncertainties ⋮ New complexity analysis of a Mehrotra-type predictor–corrector algorithm for semidefinite programming ⋮ Convex relaxations forL₂-gain analysis of piecewise affine/polynomial systems ⋮ PID controller design for nonlinear systems represented by discrete-time local model networks ⋮ A Spectral Gradient Projection Method for the Positive Semi-definite Procrustes Problem

Uses Software

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4504792&oldid=18599948"