The following pages link to SparsePOP (Q16510):
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)
- Book review of: J.-B. Lasserre, An introduction to polynomial and semi-algebraic optimization (Q321039) (← 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)
- Facial reduction algorithms for conic optimization problems (Q368590) (← links)
- Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality (Q386447) (← links)
- Global optimization of polynomials restricted to a smooth variety using sums of squares (Q412217) (← links)
- A facial reduction algorithm for finding sparse SOS representations (Q613325) (← links)
- A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming (Q623727) (← links)
- A polynomial optimization approach to constant rebalanced portfolio selection (Q694522) (← links)
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion (Q717129) (← links)
- Sum of squares method for sensor network localization (Q839485) (← links)
- Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems (Q987509) (← links)
- Recognizing underlying sparsity in optimization (Q1013977) (← links)
- Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP (Q1024721) (← links)
- Set-membership errors-in-variables identification of MIMO linear systems (Q1640709) (← links)
- A multilevel analysis of the Lasserre hierarchy (Q1735163) (← links)
- A robust unscented transformation for uncertain moments (Q1738657) (← links)
- Binary quadratic optimization problems that are difficult to solve by conic relaxations (Q1751225) (← links)
- Polynomial optimization for water networks: global solutions for the valve setting problem (Q1753591) (← links)
- Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization (Q1935573) (← links)
- The tracial moment problem and trace-optimization of polynomials (Q1942272) (← links)
- Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization (Q1949261) (← links)
- An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming (Q1994127) (← links)
- Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods (Q2010087) (← links)
- Sparse noncommutative polynomial optimization (Q2144551) (← links)
- Positivity certificates and polynomial optimization on non-compact semialgebraic sets (Q2149557) (← links)
- One-shot set-membership identification of generalized Hammerstein-Wiener systems (Q2188270) (← links)
- Reconstruction of convex bodies from moments (Q2223625) (← links)
- Exploiting term sparsity in noncommutative polynomial optimization (Q2231045) (← links)
- Alternative SDP and SOCP approximations for polynomial optimization (Q2287850) (← links)
- A new updating method for the damped mass-spring systems (Q2306758) (← links)
- Univariate parameterization for global optimization of mixed-integer polynomial problems (Q2355892) (← links)
- Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables (Q2392116) (← links)
- Solving polynomial least squares problems via semidefinite programming relaxations (Q2655337) (← links)
- Computational advances in polynomial optimization: RAPOSa, a freely available global solver (Q2689854) (← links)
- Introduction to Semidefinite, Conic and Polynomial Optimization (Q2802517) (← links)
- Exploiting Sparsity in SDP Relaxation of Polynomial Optimization Problems (Q2802536) (← links)
- Latest Developments in the SDPA Family for Solving Large-Scale SDPs (Q2802543) (← links)
- On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0 (Q2802544) (← links)
- Algorithm 950 (Q2828144) (← links)
- Certification of Bounds of Non-linear Functions: The Templates Method (Q2843005) (← links)
- Verifying Competitive Equilibria in Dynamic Economies (Q2857660) (← links)
- NLCertify: A Tool for Formal Nonlinear Optimization (Q2879141) (← links)
- Solutions of polynomial systems derived from the steady cavity flow problem (Q2883825) (← links)
- Maximum Block Improvement and Polynomial Optimization (Q2902871) (← links)
- Constrained Polynomial Optimization Problems with Noncommuting Variables (Q2910876) (← links)
- An Introduction to Polynomial and Semi-Algebraic Optimization (Q2930845) (← links)
- An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming (Q3009764) (← links)
