SparsePOP

swMATH4331MaRDI QIDQ16510FDOQ16510

Author name not available (Why is that?)

Cited In (67)

• Solutions of polynomial systems derived from the steady cavity flow problem (extended abstract).
• Exploiting structured sparsity in large scale semidefinite programming problems
• Computational advances in polynomial optimization: RAPOSa, a freely available global solver
• Verifying competitive equilibria in dynamic economies
• The tracial moment problem and trace-optimization of polynomials
• Minimizing the sum of many rational functions
• An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming
• Exploiting sparsity in SDP relaxation of polynomial optimization problems
• A polynomial optimization approach to constant rebalanced portfolio selection
• An extension of the elimination method for a sparse SOS polynomial
• Algorithm 950: Ncpol2sdpa -- sparse semidefinite programming relaxations for polynomial optimization problems of noncommuting variables
• A multilevel analysis of the Lasserre hierarchy
• An iterative scheme for valid polynomial inequality generation in binary polynomial programming
• NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials
• A multigrid approach to SDP relaxations of sparse polynomial optimization problems
• Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods
• Recognizing underlying sparsity in optimization
• Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets
• Binary quadratic optimization problems that are difficult to solve by conic relaxations
• Polynomial optimization for water networks: global solutions for the valve setting problem
• Constrained trace-optimization of polynomials in freely noncommuting variables
• Alternative SDP and SOCP approximations for polynomial optimization
• TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
• Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization
• A robust unscented transformation for uncertain moments
• Facial reduction algorithms for conic optimization problems
• Reconstruction of convex bodies from moments
• Latest Developments in the SDPA Family for Solving Large-Scale SDPs
• Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
• Moments, positive polynomials and their applications
• Set-membership errors-in-variables identification of MIMO linear systems
• Sum of squares method for sensor network localization
• On the implementation and usage of SDPT3 -- a Matlab software package for semidefinite-quadratic-linear programming, version 4.0
• Bounding the parameters of block-structured nonlinear feedback systems
• Solving partial differential equations via sparse SDP relaxations
• Positivity certificates and polynomial optimization on non-compact semialgebraic sets
• Maximum block improvement and polynomial optimization
• A new updating method for the damped mass-spring systems
• Book review of: J.-B. Lasserre, An introduction to polynomial and semi-algebraic optimization
• Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality
• Algorithm 996
• A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming
• The minimum-rank Gram matrix completion via modified fixed point continuation method
• RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems
• Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP
• Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems
• Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization
• Univariate parameterization for global optimization of mixed-integer polynomial problems
• Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension
• Introduction to semidefinite, conic and polynomial optimization
• Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
• Solving polynomial least squares problems via semidefinite programming relaxations
• GloptiPoly 3: moments, optimization and semidefinite programming
• Sparse noncommutative polynomial optimization
• Bounded error identification of Hammerstein systems through sparse polynomial optimization
• Deciding non-realizability of oriented matroids by semidefinite programming
• Exploiting term sparsity in noncommutative polynomial optimization
• One-shot set-membership identification of generalized Hammerstein-Wiener systems
• An introduction to polynomial and semi-algebraic optimization
• Title not available (Why is that?)
• Constrained polynomial optimization problems with noncommuting variables
• A facial reduction algorithm for finding sparse SOS representations
• Certification of bounds of non-linear functions: the templates method
• NLCertify: a tool for formal nonlinear optimization
• Algorithm 925, parallel solver for semidefinite programming problem having sparse Schur complement matrix
• Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables
• Global optimization of polynomials restricted to a smooth variety using sums of squares

This page was built for software: SparsePOP