The following pages link to SDPA (Q15807):
Displaying 50 items.
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems (Q263189) (← links)
- Minimizing the sum of many rational functions (Q266410) (← links)
- CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization (Q298162) (← links)
- A constraint-reduced algorithm for semidefinite optimization problems with superlinear convergence (Q306395) (← links)
- A nonmonotone GRASP (Q340011) (← links)
- On efficient sensor scheduling for linear dynamical systems (Q361004) (← links)
- Facial reduction algorithms for conic optimization problems (Q368590) (← links)
- New Turán densities for 3-graphs (Q426895) (← links)
- Parameter identification in financial market models with a feasible point SQP algorithm (Q429503) (← links)
- Abstract interpretation meets convex optimization (Q435969) (← links)
- Monochromatic triangles in three-coloured graphs (Q463289) (← links)
- A robust Lagrangian-DNN method for a class of quadratic optimization problems (Q523570) (← links)
- Robust synchronization analysis in nonlinear stochastic cellular networks with time-varying delays, intracellular perturbations and intercellular noise (Q554481) (← links)
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs (Q604951) (← links)
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints (Q607501) (← links)
- Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones (Q621748) (← links)
- An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem (Q623464) (← links)
- A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming (Q623727) (← links)
- A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with general irreducible components (Q623738) (← links)
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations (Q652290) (← links)
- Confidence structural robust design and optimization under stiffness and load uncertainties (Q660389) (← links)
- A cutting plane algorithm for semi-definite programming problems with applications to failure discriminant analysis (Q697556) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- A new approach for weighted constraint satisfaction (Q698082) (← links)
- A survey of graph edit distance (Q710632) (← links)
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons (Q717135) (← links)
- Constraints on 2d CFT partition functions (Q737716) (← links)
- Conic mixed-integer rounding cuts (Q847842) (← links)
- On verified numerical computations in convex programming (Q849186) (← links)
- Solving large-scale semidefinite programs in parallel (Q868469) (← links)
- Sums of squares based approximation algorithms for MAX-SAT (Q944728) (← links)
- A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) (Q951124) (← links)
- Approximating optimization problems over convex functions (Q957934) (← links)
- Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems (Q987509) (← links)
- Minimal condition number for positive definite Hankel matrices using semidefinite programming (Q989049) (← links)
- Applications of semidefinite programming (Q1294557) (← links)
- Search directions in the SDP and the monotone SDLCP: Generalization and inexact computation (Q1295958) (← links)
- Incomplete orthogonalization preconditioners for solving large and dense linear systems which arise from semidefinite programming (Q1349146) (← links)
- Exploiting sparsity in primal-dual interior-point methods for semidefinite programming (Q1365057) (← links)
- Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs (Q1380924) (← links)
- Stronger linear programming relaxations of max-cut (Q1403298) (← links)
- Avoiding numerical cancellation in the interior point method for solving semidefinite programs (Q1411639) (← links)
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results (Q1411643) (← links)
- An independent benchmarking of SDP and SOCP solvers (Q1411647) (← links)
- Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions (Q1415482) (← links)
- The \( \mathcal{N}=2 \) superconformal bootstrap (Q1638464) (← links)
- Multi-scale robust design and optimization considering load uncertainties (Q1667496) (← links)
- A matrix-based IRLS algorithm for the least \(l_p\)-norm design of 2-D FIR filters (Q1710933) (← links)
- Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials (Q1733314) (← links)
- Approximating the Pareto set of multiobjective linear programs via robust optimization (Q1758268) (← links)
