The following pages link to SDPT3 (Q16199):
Displaying 50 items.
- A global optimization method for multiple response optimization problems (Q2097463) (← links)
- Automata-based controller synthesis for stochastic systems: a game framework via approximate probabilistic relations (Q2103672) (← links)
- Orbital stabilization of point-to-point maneuvers in underactuated mechanical systems (Q2103715) (← links)
- Optimal scenario-dependent multivariate shortfall risk measure and its application in risk capital allocation (Q2106746) (← links)
- Coarray interpolation for joint DOD and DOA estimation in bistatic coprime MIMO radar via decoupled atomic norm minimization (Q2108454) (← links)
- Convex graph invariant relaxations for graph edit distance (Q2118089) (← links)
- Solving symmetric and positive definite second-order cone linear complementarity problem by a rational Krylov subspace method (Q2120802) (← links)
- Low-rank matrix recovery with Ky Fan 2-\(k\)-norm (Q2124796) (← links)
- Gaining or losing perspective (Q2124806) (← links)
- Local saddle points for unconstrained polynomial optimization (Q2125068) (← 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)
- Sparse noncommutative polynomial optimization (Q2144551) (← links)
- Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems (Q2146997) (← links)
- Semidefinite programming hierarchies for constrained bilinear optimization (Q2149569) (← links)
- Status determination by interior-point methods for convex optimization problems in domain-driven form (Q2149574) (← 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)
- Boundedness and global robust stability analysis of delayed complex-valued neural networks with interval parameter uncertainties (Q2179835) (← links)
- Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures (Q2182857) (← links)
- Stochastic predictive control under intermittent observations and unreliable actions (Q2188251) (← links)
- An inexact interior-point Lagrangian decomposition algorithm with inexact oracles (Q2188950) (← links)
- A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring (Q2196300) (← links)
- Dissipative stabilization of linear systems with time-varying general distributed delays (Q2208551) (← links)
- Linearization of expectation-based inequality conditions in control for discrete-time linear systems represented with random polytopes (Q2208552) (← links)
- A distributed model predictive control strategy for finite-time synchronization problems in multi-agent double-integrator systems (Q2208814) (← links)
- Robust trade-off portfolio selection (Q2218875) (← links)
- Extension of the LP-Newton method to conic programming problems via semi-infinite representation (Q2225528) (← links)
- Exploiting partial correlations in distributionally robust optimization (Q2227536) (← links)
- An accelerated Uzawa method for application to frictionless contact problem (Q2228370) (← 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 robust bank asset allocation model integrating credit-rating migration risk and capital adequacy ratio regulations (Q2241085) (← links)
- A pseudo-equilibrium finite element for limit analysis of Reissner-Mindlin plates (Q2243456) (← links)
- A linear-time algorithm for minimizing the ratio of quadratic functions with a quadratic constraint (Q2244966) (← links)
- Learning with tensors: a framework based on convex optimization and spectral regularization (Q2251466) (← links)
- Sparse trace norm regularization (Q2259743) (← links)
- Robust static super-replication of barrier options (Q2272291) (← 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)
- Alternating direction method for covariance selection models (Q2276406) (← 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)
- Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs (Q2293657) (← links)
