SDPT3
From MaRDI portal
Software:16199
No author found.
Related Items (only showing first 100 items - show all)
Variations and extension of the convex-concave procedure ⋮ Credible autocoding of convex optimization algorithms ⋮ Solving symmetric and positive definite second-order cone linear complementarity problem by a rational Krylov subspace method ⋮ Low-rank matrix recovery with Ky Fan 2-\(k\)-norm ⋮ Gaining or losing perspective ⋮ Local saddle points for unconstrained polynomial optimization ⋮ \(S_{1/2}\) regularization methods and fixed point algorithms for affine rank minimization problems ⋮ 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 ⋮ Regularized robust optimization: the optimal portfolio execution case ⋮ 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 ⋮ Computing sum of squares decompositions with rational coefficients ⋮ On the non-symmetric semidefinite Procrustes problem ⋮ Sparse noncommutative polynomial optimization ⋮ Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems ⋮ Semidefinite programming hierarchies for constrained bilinear optimization ⋮ Status determination by interior-point methods for convex optimization problems in domain-driven form ⋮ Implementation of a primal-dual method for SDP on a shared memory parallel architecture ⋮ On semidefinite programming relaxations for the satisfiability problem ⋮ Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem ⋮ Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation ⋮ A bounded degree SOS hierarchy for polynomial optimization ⋮ A unified probabilistic framework for robust manifold learning and embedding ⋮ On gridless sparse methods for multi-snapshot direction of arrival estimation ⋮ A factorization method for completely positive matrices ⋮ Dwell-time stability and stabilization conditions for linear positive impulsive and switched systems ⋮ 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 ⋮ Boundedness and global robust stability analysis of delayed complex-valued neural networks with interval parameter uncertainties ⋮ Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures ⋮ Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools ⋮ Stochastic predictive control under intermittent observations and unreliable actions ⋮ A primal-dual interior-point method based on various selections of displacement step for symmetric optimization ⋮ 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 ⋮ An inexact interior-point Lagrangian decomposition algorithm with inexact oracles ⋮ Optimization based methods for partially observed chaotic systems ⋮ On a box-constrained linear symmetric cone optimization problem ⋮ Strong delay-independent stability of linear delay systems ⋮ Portfolio benefits of adding corporate credit default swap indices: evidence from North America and Europe ⋮ A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring ⋮ Positive definiteness of diffusion kurtosis imaging ⋮ Smoothing Newton algorithm for symmetric cone complementarity problems based on a one-parametric class of smoothing functions ⋮ 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 ⋮ Robust trade-off portfolio selection ⋮ Extension of the LP-Newton method to conic programming problems via semi-infinite representation ⋮ Exploiting partial correlations in distributionally robust optimization ⋮ An accelerated Uzawa method for application to frictionless contact problem ⋮ 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 ⋮ A robust bank asset allocation model integrating credit-rating migration risk and capital adequacy ratio regulations ⋮ A pseudo-equilibrium finite element for limit analysis of Reissner-Mindlin plates ⋮ A linear-time algorithm for minimizing the ratio of quadratic functions with a quadratic constraint ⋮ Learning with tensors: a framework based on convex optimization and spectral regularization ⋮ Sparse trace norm regularization ⋮ Robust static super-replication of barrier options ⋮ Nonconvex min-max fractional quadratic problems under quadratic constraints: copositive relaxations ⋮ Observers for systems with nonlinearities satisfying incremental quadratic constraints ⋮ Alternating direction method for covariance selection models ⋮ On the quantification of aleatory and epistemic uncertainty using sliced-normal distributions ⋮ Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials ⋮ A strategy of global convergence for the affine scaling algorithm for convex semidefinite programming ⋮ Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs ⋮ Minimal conic quadratic reformulations and an optimization model ⋮ Conic relaxation approaches for equal deployment problems ⋮ A line search exact penalty method for nonlinear semidefinite programming ⋮ Robust \(\mathcal{H}_\infty\) proportional-integral observer-based controller for uncertain LPV system ⋮ Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation ⋮ A Euclidean distance matrix model for protein molecular conformation ⋮ Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting ⋮ An efficient numerical method for the symmetric positive definite second-order cone linear complementarity problem ⋮ Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms ⋮ A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs ⋮ Determinantal sampling designs ⋮ A smoothing method with appropriate parameter control based on Fischer-Burmeister function for second-order cone complementarity problems ⋮ Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning ⋮ Improved row-by-row method for binary quadratic optimization problems ⋮ T-optimal designs for multi-factor polynomial regression models via a semidefinite relaxation method ⋮ An inexact dual logarithmic barrier method for solving sparse semidefinite programs ⋮ Generalized self-concordant functions: a recipe for Newton-type methods ⋮ Distributionally robust return-risk optimization models and their applications ⋮ A non-convex algorithm framework based on DC programming and DCA for matrix completion ⋮ A global optimization method for multiple response optimization problems ⋮ 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 ⋮ Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization ⋮ Semidefinite inverse eigenvalue problems with prescribed entries and partial eigendata ⋮ Optimal scenario-dependent multivariate shortfall risk measure and its application in risk capital allocation ⋮ Coarray interpolation for joint DOD and DOA estimation in bistatic coprime MIMO radar via decoupled atomic norm minimization ⋮ Exploiting symmetry in copositive programs via semidefinite hierarchies ⋮ 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
This page was built for software: SDPT3
