Pages that link to "Item:Q4504792"
From MaRDI portal
The following pages link to SDPT3 — A Matlab software package for semidefinite programming, Version 1.3 (Q4504792):
Displaying 50 items.
- Low-rank matrix recovery with Ky Fan 2-\(k\)-norm (Q2124796) (← links)
- Gaining or losing perspective (Q2124806) (← links)
- Role of sparsity and structure in the optimization landscape of non-convex matrix sensing (Q2133410) (← links)
- A new wide-neighborhood predictor-corrector interior-point method for semidefinite optimization (Q2142525) (← links)
- A globally convergent method for solving a quartic generalized Markowitz portfolio problem (Q2143112) (← links)
- On the non-symmetric semidefinite Procrustes problem (Q2144240) (← links)
- An interior-point algorithm for semidefinite least-squares problems. (Q2148405) (← links)
- DC semidefinite programming and cone constrained DC optimization. I: Theory (Q2149953) (← links)
- Certifying the global optimality of quartic minimization over the sphere (Q2158108) (← links)
- A factorization method for completely positive matrices (Q2174498) (← links)
- Set-based control for disturbed piecewise affine systems with state and actuation constraints (Q2178184) (← links)
- On the numerical solution of differential linear matrix inequalities (Q2178893) (← links)
- Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures (Q2182857) (← links)
- A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring (Q2196300) (← links)
- A distributed model predictive control strategy for finite-time synchronization problems in multi-agent double-integrator systems (Q2208814) (← links)
- Exploiting partial correlations in distributionally robust optimization (Q2227536) (← links)
- Exact algorithms for semidefinite programs with degenerate feasible set (Q2229751) (← links)
- A note on convex relaxations for the inverse eigenvalue problem (Q2230796) (← links)
- \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM (Q2231040) (← links)
- COSMO: a conic operator splitting method for convex conic problems (Q2231337) (← links)
- A linear-time algorithm for minimizing the ratio of quadratic functions with a quadratic constraint (Q2244966) (← links)
- Sparse trace norm regularization (Q2259743) (← links)
- Nonconvex min-max fractional quadratic problems under quadratic constraints: copositive relaxations (Q2274881) (← links)
- Observers for systems with nonlinearities satisfying incremental quadratic constraints (Q2276101) (← links)
- On the quantification of aleatory and epistemic uncertainty using sliced-normal distributions (Q2278545) (← links)
- Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials (Q2279398) (← links)
- A strategy of global convergence for the affine scaling algorithm for convex semidefinite programming (Q2288182) (← links)
- Minimal conic quadratic reformulations and an optimization model (Q2294364) (← links)
- Conic relaxation approaches for equal deployment problems (Q2297663) (← links)
- Robust \(\mathcal{H}_\infty\) proportional-integral observer-based controller for uncertain LPV system (Q2306170) (← links)
- Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation (Q2307500) (← links)
- Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting (Q2307758) (← links)
- An efficient numerical method for the symmetric positive definite second-order cone linear complementarity problem (Q2316190) (← links)
- Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning (Q2322556) (← links)
- Improved row-by-row method for binary quadratic optimization problems (Q2327692) (← links)
- T-optimal designs for multi-factor polynomial regression models via a semidefinite relaxation method (Q2329795) (← links)
- Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization (Q2346399) (← links)
- The density of sets avoiding distance 1 in Euclidean space (Q2351016) (← links)
- Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm (Q2354819) (← links)
- Variations and extension of the convex-concave procedure (Q2358020) (← links)
- Credible autocoding of convex optimization algorithms (Q2358081) (← links)
- Convex optimization learning of faithful Euclidean distance representations in nonlinear dimensionality reduction (Q2364497) (← links)
- On convex quadratic programs with linear complementarity constraints (Q2377168) (← links)
- Implementation of a primal-dual method for SDP on a shared memory parallel architecture (Q2385546) (← links)
- Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation (Q2397097) (← links)
- A bounded degree SOS hierarchy for polynomial optimization (Q2397758) (← links)
- On gridless sparse methods for multi-snapshot direction of arrival estimation (Q2405547) (← links)
- Multiple window moving horizon estimation (Q2409442) (← links)
- A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme (Q2419534) (← links)
- Long-step path-following algorithm for solving symmetric programming problems with nonlinear objective functions (Q2419536) (← links)
