Cited in
(only showing first 100 items - show all)- An augmented Lagrangian dual approach for the H-weighted nearest correlation matrix problem
- Global registration of multiple point clouds using semidefinite programming
- An active-set method for second-order conic-constrained quadratic programming
- Semidefinite programming for the educational testing problem
- Linear matrix inequalities in control systems with uncertainty
- A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation
- An optimal-storage approach to semidefinite programming using approximate complementarity
- Positive definiteness of diffusion kurtosis imaging
- Sparse approximation of functions using sums of exponentials and AAK theory
- Solving some large scale semidefinite programs via the conjugate residual method
- Primal recovery from consensus-based dual decomposition for distributed convex optimization
- Checking dissipativity of linear behavior systems given in kernel representation
- An alternating direction method with continuation for nonconvex low rank minimization
- Dissipative stabilization of linear systems with time-varying general distributed delays
- Linearization of expectation-based inequality conditions in control for discrete-time linear systems represented with random polytopes
- A distributed model predictive control strategy for finite-time synchronization problems in multi-agent double-integrator systems
- Corrigendum: Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results
- An iterative rank penalty method for nonconvex quadratically constrained quadratic programs
- Composite convex optimization with global and local inexact oracles
- A paradox in bosonic energy computations via semidefinite programming relaxations
- Return-mapping algorithms for associative isotropic hardening plasticity using conic optimization
- Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning
- A selective strategy for shakedown analysis of engineering structures
- scientific article; zbMATH DE number 1862745 (Why is no real title available?)
- On Handling Free Variables in Interior-Point Methods for Conic Linear Optimization
- On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems
- A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity
- The tracial moment problem and trace-optimization of polynomials
- Normalized iterative hard thresholding for matrix completion
- Approximate minimum enclosing balls in high dimensions using core-sets
- An augmented Lagrangian dual optimization approach to the H-weighted model updating problem
- An efficient matrix splitting method for the second-order cone complementarity problem
- POS3POLY -- a MATLAB preprocessor for optimization with positive polynomials
- Quadratic model updating with gyroscopic structure from partial eigendata
- Improving an upper bound on the size of \(k\)-regular induced subgraphs
- The MIN-cut and vertex separator problem
- Approximating the maximum size of a \(k\)-regular induced subgraph by an upper bound on the co-\(k\)-plex number
- Improved lower bounds for the 2-page crossing numbers of \(K_{m,n}\) and \(K_n\) via semidefinite programming
- Regularization methods for SDP relaxations in large-scale polynomial optimization
- POLYNOMIAL BOUNDS FOR SOLUTIONS TO BOUNDARY VALUE AND OBSTACLE PROBLEMS WITH APPLICATIONS TO FINANCIAL DERIVATIVE PRICING
- Proximal alternating direction method with relaxed proximal parameters for the least squares covariance adjustment problem
- Solving PhaseLift by Low-Rank Riemannian Optimization Methods for Complex Semidefinite Constraints
- Advances in computational Lyapunov analysis using sum-of-squares programming
- Polynomial optimization with applications to stability analysis and control -- alternatives to sum of squares
- ``Virus hunting using radial distance weighted discrimination
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
- Generalized Gauss inequalities via semidefinite programming
- Integrated inventory control and facility location decisions in a multi-echelon supply chain network with hubs
- Minimizing the sum of many rational functions
- 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
- An implementable proximal point algorithmic framework for nuclear norm minimization
- Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools
- Automata-based controller synthesis for stochastic systems: a game framework via approximate probabilistic relations
- Orbital stabilization of point-to-point maneuvers in underactuated mechanical systems
- Optimal scenario-dependent multivariate shortfall risk measure and its application in risk capital allocation
- Bounds on heat transfer for Bénard-Marangoni convection at infinite Prandtl number
- Complexity Analysis of a Sampling-Based Interior Point Method for Convex Optimization
- Parameter-related projection-based iterative algorithm for a kind of generalized positive semidefinite least squares problem
- Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data
- A line search penalty-free method for nonlinear second-order cone programming
- Strong delay-independent stability of linear delay systems
- Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs
- Epidemic Spreading Curing Strategy Over Directed Networks
- An equivalency condition of nonsingularity in nonlinear semidefinite programming
- The numerics of phase retrieval
- T-optimal designs for multi-factor polynomial regression models via a semidefinite relaxation method
- A proximal fully parallel splitting method for stable principal component pursuit
- Robust static super-replication of barrier options
- Improved row-by-row method for binary quadratic optimization problems
- A fast nonlinear control method for linear systems with input saturation
- A VNS metaheuristic with stochastic steps for Max 3-cut and Max 3-section
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem
- Fixed point and Bregman iterative methods for matrix rank minimization
- Exploiting sparsity in SDP relaxation of polynomial optimization problems
- Coprime factors reduction methods for linear parameter varying and uncertain systems
- An accelerated active-set algorithm for a quadratic semidefinite program with general constraints
- SDP design procedures for near-optimum IIR compaction filters
- Parametric analysis of semidefinite optimization
- An alternating direction method for solving convex nonlinear semidefinite programming problems
- A non-convex algorithm framework based on DC programming and DCA for matrix completion
- A new semidefinite programming relaxation for the quadratic assignment problem and its computational perspectives
- Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties
- LFTB: an efficient algorithm to bound linear fractional transformations
- A fast design algorithm for elliptic-error and phase-error constrained LS 2-D FIR filters
- Exact dual semi-definite programs for affinely adjustable robust SOS-convex polynomial optimization problems
- Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials
- Suspended load path tracking control using a tilt-rotor UAV based on zonotopic state estimation
- Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem
- Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms
- Semidefinite optimization approaches for satisfiability and maximum-satisfiability problems
- A parallel interior point decomposition algorithm for block angular semidefinite programs
- Generalized self-concordant functions: a recipe for Newton-type methods
- Sparsity in sums of squares of polynomials
- A second-order cone cutting surface method: Complexity and application
- New algorithms for \(k\)-center and extensions
- Learning semidefinite regularizers
- Some new search directions for primal-dual interior point methods in semidefinite programming
- Finding planted subgraphs with few eigenvalues using the Schur-Horn relaxation
- Conic programming: infeasibility certificates and projective geometry
This page was built for software: SDPT3
