Pages that link to "Item:Q3511949"
From MaRDI portal
The following pages link to EQUALITY BASED CONTRACTION OF SEMIDEFINITE PROGRAMMING RELAXATIONS IN POLYNOMIAL OPTIMIZATION (Q3511949):
Displaying 8 items.
- Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets (Q288220) (← links)
- Real ideal and the duality of semidefinite programming for polynomial optimization (Q351462) (← links)
- An exact Jacobian SDP relaxation for polynomial optimization (Q1942264) (← links)
- Perturbed sums-of-squares theorem for polynomial optimization and its applications (Q2811486) (← links)
- Regularization methods for SDP relaxations in large-scale polynomial optimization (Q2910878) (← links)
- AN EXTENSION OF THE ELIMINATION METHOD FOR A SPARSE SOS POLYNOMIAL(<Special Issue>SCOPE (Seminar on Computation and OPtimization for new Extensions)) (Q3144757) (← links)
- (Q3632452) (← links)
- An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization (Q6165592) (← links)
