Pages that link to "Item:Q1424271"
From MaRDI portal
The following pages link to Semidefinite programming relaxations for semialgebraic problems (Q1424271):
Displaying 50 items.
- Conditions for strong ellipticity and M-eigenvalues (Q1042549) (← links)
- On the Slater condition for the SDP relaxations of nonconvex sets (Q1604046) (← links)
- Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches (Q1616947) (← links)
- Symmetry in Turán sums of squares polynomials from flag algebras (Q1637376) (← links)
- Set-membership errors-in-variables identification of MIMO linear systems (Q1640709) (← links)
- Arc length based maximal Lyapunov functions and domains of attraction estimation for polynomial nonlinear systems (Q1640738) (← links)
- On linear programming relaxations for solving polynomial programming problems (Q1654348) (← links)
- Chebyshev model arithmetic for factorable functions (Q1675562) (← links)
- UTA-poly and UTA-splines: additive value functions with polynomial marginals (Q1681484) (← links)
- On robust stability of switched systems in the context of Filippov solutions (Q1690967) (← links)
- Augmented finite transition systems as abstractions for control synthesis (Q1693823) (← links)
- Optimal bounds and extremal trajectories for time averages in nonlinear dynamical systems (Q1709156) (← links)
- Bounding averages rigorously using semidefinite programming: mean moments of the Lorenz system (Q1744121) (← links)
- DC decomposition of nonconvex polynomials with algebraic techniques (Q1749445) (← links)
- Optimization over structured subsets of positive semidefinite matrices via column generation (Q1751222) (← links)
- An improved semidefinite programming relaxation for the satisfiability problem (Q1774165) (← links)
- Sparsity in sums of squares of polynomials (Q1777218) (← links)
- From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems (Q1777422) (← links)
- Inverse conic programming with applications (Q1779714) (← links)
- Semidefinite and linear programming integrality gaps for scheduling identical machines (Q1800998) (← links)
- Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms (Q1877018) (← links)
- Symmetry groups, semidefinite programs, and sums of squares (Q1878418) (← links)
- Global optimization of polynomial-expressed nonlinear optimal control problems with semidefinite programming relaxation (Q1928270) (← links)
- The convex geometry of linear inverse problems (Q1928276) (← links)
- Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization (Q1935573) (← links)
- On solving biquadratic optimization via semidefinite relaxation (Q1935575) (← links)
- Exact SDP relaxations for classes of nonlinear semidefinite programming problems (Q1939707) (← links)
- The tracial moment problem and trace-optimization of polynomials (Q1942272) (← links)
- On relations between summands in the discriminant of a symmetric matrix (Q1947803) (← links)
- Automatically discovering relaxed Lyapunov functions for polynomial dynamical systems (Q1949085) (← links)
- The matricial relaxation of a linear matrix inequality (Q1949260) (← links)
- Relaxations of the satisfiability problem using semidefinite programming (Q1977751) (← links)
- Lift \& project systems performing on the partial-vertex-cover polytope (Q1989348) (← links)
- The tracial moment problem on quadratic varieties (Q1998623) (← links)
- Explicit hard bounding functions for boundary value problems for elliptic partial differential equations (Q2006566) (← 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)
- T-positive semidefiniteness of third-order symmetric tensors and T-semidefinite programming (Q2026772) (← links)
- An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation (Q2044572) (← links)
- Analysis of optimization algorithms via sum-of-squares (Q2046552) (← links)
- An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood (Q2048820) (← links)
- The weirdness theorem and the origin of quantum paradoxes (Q2062465) (← links)
- Safety of stochastic systems: an analytic and computational approach (Q2065176) (← links)
- Finding unstable periodic orbits: a hybrid approach with polynomial optimization (Q2077605) (← links)
- Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space (Q2079694) (← links)
- Compositional construction of control barrier functions for continuous-time stochastic hybrid systems (Q2081792) (← links)
- An approximation algorithm for the maximum spectral subgraph problem (Q2082202) (← links)
- Convergence rate of block-coordinate maximization Burer-Monteiro method for solving large SDPs (Q2089773) (← links)
- Feedback control design using sum of squares optimisation (Q2095324) (← links)
