Pages that link to "Item:Q2706355"

The following pages link to Global optimization with polynomials and the problem of moments (Q2706355):

Displaying 50 items.

• A modified infeasible interior-point algorithm with full-Newton step for semidefinite optimization (Q5031729) (← links)
• Further results on sum-of-squares tensors (Q5038186) (← links)
• Fair Colorful k-Center Clustering (Q5041747) (← links)
• Maximal Quadratic-Free Sets (Q5041754) (← links)
• Dual Certificates and Efficient Rational Sum-of-Squares Decompositions for Polynomial Optimization over Compact Sets (Q5043282) (← links)
• Lifting the Convex Conjugate in Lagrangian Relaxations: A Tractable Approach for Continuous Markov Random Fields (Q5043730) (← links)
• Lifting for Simplicity: Concise Descriptions of Convex Sets (Q5044992) (← links)
• Noncommutative Christoffel-Darboux kernels (Q5047921) (← links)
• Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
• Sum-of-Squares Hierarchies for Polynomial Optimization and the Christoffel--Darboux Kernel (Q5051374) (← links)
• Confidence regions for the location of response surface optima: the R package OptimaRegion (Q5055191) (← links)
• Disordered systems insights on computational hardness (Q5055432) (← links)
• Finding Minimum Volume Circumscribing Ellipsoids Using Generalized Copositive Programming (Q5058050) (← links)
• Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints (Q5060505) (← links)
• Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties (Q5072221) (← links)
• Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph (Q5072588) (← links)
• Tractable Relaxations of Composite Functions (Q5085133) (← links)
• Optimization on the Euclidean Unit Sphere (Q5087107) (← links)
• Convergence of a Constrained Vector Extrapolation Scheme (Q5089736) (← links)
• (Q5090440) (← links)
• Short Proofs Are Hard to Find (Q5091243) (← links)
• (Q5091260) (← links)
• Size-degree trade-offs for sums-of-squares and positivstellensatz proofs (Q5091776) (← links)
• (Q5107811) (← links)
• Revisiting Stochastic Loss Networks: Structures and Approximations (Q5108223) (← links)
• On the Construction of Converging Hierarchies for Polynomial Optimization Based on Certificates of Global Positivity (Q5108237) (← links)
• Application of direct extended modified algebraic method of Bogoyavlenskii equation on lower and upper bounds in managing and optimizing queues (Q5125359) (← links)
• Distributionally Robust Optimization with Infinitely Constrained Ambiguity Sets (Q5129197) (← links)
• Bounding extrema over global attractors using polynomial optimisation (Q5130916) (← links)
• Computing the Hausdorff Boundary Measure of Semialgebraic Sets (Q5130991) (← links)
• The Convex Hull of a Quadratic Constraint over a Polytope (Q5131962) (← links)
• Exploring the Limits of Subadditive Approaches: Parallels between Optimization and Complexity Theory (Q5135262) (← links)
• A paradox in bosonic energy computations via semidefinite programming relaxations (Q5141427) (← links)
• TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity (Q5148403) (← links)
• Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension (Q5148406) (← links)
• Minimizing Rational Functions: A Hierarchy of Approximations via Pushforward Measures (Q5152480) (← links)
• Semidefinite Optimization Estimating Bounds on Linear Functionals Defined on Solutions of Linear ODEs (Q5153670) (← links)
• Hilbert’s 17th problem in free skew fields (Q5154784) (← links)
• A Lagrange Multiplier Expression Method for Bilevel Polynomial Optimization (Q5158762) (← links)
• Minimum wave speeds in monostable reaction–diffusion equations: sharp bounds by polynomial optimization (Q5161096) (← links)
• BREAKING THE RECTANGLE BOUND BARRIER AGAINST FORMULA SIZE LOWER BOUNDS (Q5168421) (← links)
• Alternating direction method of multipliers for real and complex polynomial optimization models (Q5169464) (← links)
• Adaptive computable approximation to cones of nonnegative quadratic functions (Q5169468) (← links)
• Computational and statistical tradeoffs via convex relaxation (Q5170958) (← links)
• Approximation of Model Predictive Control Laws for Polynomial Systems (Q5172925) (← links)
• Smoothing and Regularization for Mixed-Integer Second-Order Cone Programming with Applications in Portfolio Optimization (Q5172959) (← links)
• Optimizing ordered median functions with applications to single facility location (Q5176324) (← links)
• Formal Proofs for Nonlinear Optimization (Q5195260) (← links)
• A global optimization algorithm for polynomial programming (Q5197301) (← links)
• Best Nonnegative Rank-One Approximations of Tensors (Q5203971) (← links)