Pages that link to "Item:Q146795"
From MaRDI portal
The following pages link to Solving semidefinite-quadratic-linear programs using SDPT3 (Q146795):
Displaying 50 items.
- Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods (Q2010087) (← links)
- A fast design algorithm for elliptic-error and phase-error constrained LS 2-D FIR filters (Q2014193) (← links)
- A survey on conic relaxations of optimal power flow problem (Q2023908) (← links)
- An accelerated active-set algorithm for a quadratic semidefinite program with general constraints (Q2026764) (← links)
- Minimal-norm static feedbacks using dissipative Hamiltonian matrices (Q2029851) (← links)
- Analysis of optimization algorithms via sum-of-squares (Q2046552) (← links)
- Projection-based integrators for improved motion control: formalization, well-posedness and stability of hybrid integrator-gain systems (Q2065165) (← links)
- Strictly contractive Peaceman-Rachford splitting method to recover the corrupted low rank matrix (Q2067888) (← links)
- \(\mathcal{H}_\infty\) network optimization for edge consensus (Q2068543) (← links)
- \texttt{Tenscalc}: a toolbox to generate fast code to solve nonlinear constrained minimizations and compute Nash equilibria (Q2088964) (← links)
- Second-order cone and semidefinite methods for the bisymmetric matrix approximation problem (Q2091722) (← links)
- High-probability stable Gaussian process-supported model predictive control for Lur'e systems (Q2095350) (← 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)
- Solving symmetric and positive definite second-order cone linear complementarity problem by a rational Krylov subspace method (Q2120802) (← links)
- Role of sparsity and structure in the optimization landscape of non-convex matrix sensing (Q2133410) (← 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)
- DC semidefinite programming and cone constrained DC optimization. I: Theory (Q2149953) (← links)
- On the robustness of noise-blind low-rank recovery from rank-one measurements (Q2168911) (← links)
- A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring (Q2196300) (← links)
- Linearization of expectation-based inequality conditions in control for discrete-time linear systems represented with random polytopes (Q2208552) (← 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)
- 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)
- Alternating direction method for covariance selection models (Q2276406) (← links)
- Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs (Q2293657) (← links)
- Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation (Q2307500) (← links)
- A Euclidean distance matrix model for protein molecular conformation (Q2307747) (← links)
- An efficient numerical method for the symmetric positive definite second-order cone linear complementarity problem (Q2316190) (← links)
- A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs (Q2316619) (← links)
- A smoothing method with appropriate parameter control based on Fischer-Burmeister function for second-order cone complementarity problems (Q2319164) (← 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)
- An inexact dual logarithmic barrier method for solving sparse semidefinite programs (Q2330644) (← links)
- Distributionally robust return-risk optimization models and their applications (Q2336705) (← links)
- A non-convex algorithm framework based on DC programming and DCA for matrix completion (Q2340366) (← links)
- Semidefinite inverse eigenvalue problems with prescribed entries and partial eigendata (Q2346642) (← links)
- Exploiting symmetry in copositive programs via semidefinite hierarchies (Q2349140) (← 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)
- \(S_{1/2}\) regularization methods and fixed point algorithms for affine rank minimization problems (Q2364127) (← links)
- Computing sum of squares decompositions with rational coefficients (Q2378506) (← links)
- Implementation of a primal-dual method for SDP on a shared memory parallel architecture (Q2385546) (← links)
- Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem (Q2391873) (← links)
- A bounded degree SOS hierarchy for polynomial optimization (Q2397758) (← links)
