Pages that link to "Item:Q5470252"
From MaRDI portal
The following pages link to Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity (Q5470252):
Displaying 50 items.
- Minimizing the sum of many rational functions (Q266410) (← links)
- Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets (Q288220) (← links)
- Global optimization with spline constraints: a new branch-and-bound method based on B-splines (Q300751) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems (Q340017) (← links)
- Bounded error identification of Hammerstein systems through sparse polynomial optimization (Q361063) (← links)
- Welfare-maximizing correlated equilibria using Kantorovich polynomials with sparsity (Q367164) (← links)
- Solving stress constrained problems in topology and material optimization (Q381807) (← links)
- Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality (Q386447) (← links)
- Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms (Q457226) (← links)
- Lower bounds on the global minimum of a polynomial (Q461443) (← links)
- Global optimality conditions and optimization methods for polynomial programming problems (Q496629) (← links)
- Partitioning procedure for polynomial optimization (Q604960) (← links)
- A facial reduction algorithm for finding sparse SOS representations (Q613325) (← links)
- Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones (Q621748) (← links)
- Min-max and robust polynomial optimization (Q652661) (← links)
- Semidefinite programming for min-max problems and games (Q662286) (← links)
- A polynomial optimization approach to constant rebalanced portfolio selection (Q694522) (← links)
- Canonical dual least square method for solving general nonlinear systems of quadratic equations (Q711390) (← links)
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion (Q717129) (← links)
- Smaller SDP for SOS decomposition (Q746820) (← links)
- Sum of squares method for sensor network localization (Q839485) (← links)
- Moments and sums of squares for polynomial optimization and related problems (Q842714) (← links)
- Semidefinite programming and sums of Hermitian squares of noncommutative polynomials (Q847674) (← links)
- A parallel interior point decomposition algorithm for block angular semidefinite programs (Q969720) (← links)
- Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems (Q987509) (← links)
- A semidefinite programming approach to the generalized problem of moments (Q995783) (← links)
- Positive polynomials on projective limits of real algebraic varieties (Q998968) (← links)
- A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones (Q1001199) (← links)
- Recognizing underlying sparsity in optimization (Q1013977) (← links)
- Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP (Q1024721) (← links)
- Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches (Q1616947) (← links)
- Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity (Q1646680) (← links)
- On linear programming relaxations for solving polynomial programming problems (Q1654348) (← links)
- A multilevel analysis of the Lasserre hierarchy (Q1735163) (← links)
- On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint (Q1749450) (← links)
- Binary quadratic optimization problems that are difficult to solve by conic relaxations (Q1751225) (← links)
- Approximating Pareto curves using semidefinite relaxations (Q1785276) (← links)
- Global optimization of polynomial-expressed nonlinear optimal control problems with semidefinite programming relaxation (Q1928270) (← links)
- Strong duality and minimal representations for cone optimization (Q1928754) (← links)
- Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization (Q1935573) (← links)
- An algorithm for semi-infinite polynomial optimization (Q1935882) (← links)
- Discussion on: ``A decomposition algorithm for KYP-SDPs'' (Q1937317) (← links)
- Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization (Q1949261) (← links)
- Convex underestimators of polynomials (Q1955542) (← links)
- On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems (Q2007822) (← links)
- A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs (Q2010098) (← links)
- A survey on conic relaxations of optimal power flow problem (Q2023908) (← links)
- Newton polytopes and relative entropy optimization (Q2067684) (← links)
- A sublevel moment-SOS hierarchy for polynomial optimization (Q2070330) (← links)
