On the public citation graph
Detecting Global Optimality and Extracting Solutions in GloptiPoly
0 signed · 269 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/s10107-003-0387-5openalex-snapshot
Semidefinite programming relaxations for semialgebraic problems
inferredcites →https://doi.org/10.1090/cbms/097openalex-snapshot
Solving Systems of Polynomial Equations
inferredcites →https://doi.org/10.1090/s0002-9947-00-02472-7openalex-snapshot
The truncated complex $K$-moment problem
inferredcites →https://doi.org/10.1090/s0002-9947-01-02898-7openalex-snapshot
Polynomials nonnegative on a grid and discrete optimization
inferredcites →https://doi.org/10.1109/cdc.2000.912071openalex-snapshot
An LMI-based approach for characterizing the solution set of polynomial systems
inferredcites →https://doi.org/10.1137/s1052623400366802openalex-snapshot
Global Optimization with Polynomials and the Problem of Moments
inferredcites →https://doi.org/10.1137/s1052623400380079openalex-snapshot
An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs
inferredcites →https://doi.org/10.1145/258726.258767openalex-snapshot
A reordered Schur factorization method for zero-dimensional polynomial systems with multiple roots
inferredcites →https://doi.org/10.1145/29380.29862openalex-snapshot
Some tests of generalized bisection
inferredcites →https://doi.org/10.1287/moor.28.2.246.14485openalex-snapshot
On Cones of Nonnegative Quadratic Functions
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.900108openalex-extracted
Optimization of Univariate Functions on Bounded Intervals by Interpolation and Semidefinite Programming
inferred← citeshttps://doi.org/10.1002/9780470748916.ch4openalex-snapshot
Algorithms for Minimax and Expected Value Optimization
inferred← citeshttps://doi.org/10.1002/9781118104750.ch24openalex-snapshot
Polynomial‐Based Methods for Localization in Multiagent Systems
inferred← citeshttps://doi.org/10.1002/nla.2125openalex-snapshot
A semidefinite program approach for computing the maximum eigenvalue of a class of structured tensors and its applications in hypergraphs and copositivity test
inferred← citeshttps://doi.org/10.1002/stc.2263openalex-snapshot
Model updating using sum of squares (SOS) optimization to minimize modal dynamic residuals
inferred← citeshttps://doi.org/10.1007/10997703_7openalex-snapshot
On the Equivalence of Algebraic Approaches to the Minimization of Forms on the Simplex
inferred← citeshttps://doi.org/10.1007/11832225_27openalex-snapshot
Convergent SDP-Relaxations for Polynomial Optimization with Sparsity
inferred← citeshttps://doi.org/10.1007/978-0-387-09686-5_7openalex-snapshot
Sums of Squares, Moment Matrices and Optimization Over Polynomials
inferred← citeshttps://doi.org/10.1007/978-0-387-75714-8_5openalex-snapshot
Nonconvex Optimization for Communication Networks
inferred← citeshttps://doi.org/10.1007/978-1-4613-0247-6openalex-snapshot
Advances in Mechanics and Mathematics
inferred← citeshttps://doi.org/10.1007/978-1-4614-0769-0_18openalex-snapshot
Exploiting Sparsity in SDP Relaxation of Polynomial Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-1-4614-0769-0_2openalex-snapshot
The Approach of Moments for Polynomial Equations
inferred← citeshttps://doi.org/10.1007/978-1-4614-0769-0_20openalex-snapshot
Projection Methods in Conic Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4614-0769-0_21openalex-snapshot
SDP Relaxations for Non-Commutative Polynomial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4614-1927-3_16openalex-snapshot
Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-031-16375-3_2openalex-snapshot
Optimal Feature Manipulation Attacks Against Linear Regression
inferred← citeshttps://doi.org/10.1007/978-3-031-38659-6_5openalex-snapshot
Matrix Factorization Ranks Via Polynomial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-33338-0_4openalex-snapshot
Eigenvalue Optimization of Polynomials in Non-commuting Variables
inferred← citeshttps://doi.org/10.1007/978-3-540-36119-0_15openalex-snapshot
Nonlinear Model Predictive Control and Sum of Squares Techniques
inferred← citeshttps://doi.org/10.1007/s00013-009-0007-6openalex-snapshot
A generalized flat extension theorem for moment matrices
inferred← citeshttps://doi.org/10.1007/s00186-017-0608-yopenalex-snapshot
Norm bounds and underestimators for unconstrained polynomial integer minimization
inferred← citeshttps://doi.org/10.1007/s10013-024-00700-3openalex-snapshot
Polynomial Optimization Over Unions of Sets
inferred← citeshttps://doi.org/10.1007/s10107-005-0672-6openalex-snapshot
Minimizing Polynomials via Sum of Squares over the Gradient Ideal
inferred← citeshttps://doi.org/10.1007/s10107-009-0283-8openalex-snapshot
Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
inferred← citeshttps://doi.org/10.1007/s10107-011-0489-4openalex-snapshot
An exact Jacobian SDP relaxation for polynomial optimization
inferred← citeshttps://doi.org/10.1007/s10107-011-0505-8openalex-snapshot
The tracial moment problem and trace-optimization of polynomials
inferred← citeshttps://doi.org/10.1007/s10107-012-0589-9openalex-snapshot
Certifying convergence of Lasserre’s hierarchy via flat truncation
inferred← citeshttps://doi.org/10.1007/s10107-013-0680-xopenalex-snapshot
Optimality conditions and finite convergence of Lasserre’s hierarchy
inferred← citeshttps://doi.org/10.1007/s10107-014-0788-7openalex-snapshot
Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods
inferred← citeshttps://doi.org/10.1007/s10107-014-0797-6openalex-snapshot
Linear optimization with cones of moments and nonnegative polynomials
inferred← citeshttps://doi.org/10.1007/s10107-014-0845-2openalex-snapshot
The hierarchy of local minimums in polynomial optimization
inferred← citeshttps://doi.org/10.1007/s10107-017-1167-yopenalex-snapshot
Tensor eigenvalue complementarity problems
inferred← citeshttps://doi.org/10.1007/s10107-018-1276-2openalex-snapshot
Tight relaxations for polynomial optimization and Lagrange multiplier expressions
inferred← citeshttps://doi.org/10.1007/s10107-021-01634-1openalex-snapshot
Positivity certificates and polynomial optimization on non-compact semialgebraic sets
inferred← citeshttps://doi.org/10.1007/s10107-021-01739-7openalex-snapshot
Convex generalized Nash equilibrium problems and polynomial optimization
inferred← citeshttps://doi.org/10.1007/s10107-022-01878-5openalex-snapshot
Homogenization for polynomial optimization with unbounded sets
inferred← citeshttps://doi.org/10.1007/s10107-023-01993-xopenalex-snapshot
Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks
inferred← citeshttps://doi.org/10.1007/s10107-024-02072-5openalex-snapshot
Sum-of-squares relaxations for polynomial min–max problems over simple sets
inferred← citeshttps://doi.org/10.1007/s10107-024-02165-1openalex-snapshot
Quantifying low rank approximations of third order symmetric tensors
inferred← citeshttps://doi.org/10.1007/s10107-025-02199-zopenalex-snapshot
Finite convergence of the Moment-SOS hierarchy for polynomial matrix optimization
inferred← citeshttps://doi.org/10.1007/s10107-025-02223-2openalex-snapshot
A characterization for tightness of the sparse Moment-SOS hierarchy
inferred← citeshttps://doi.org/10.1007/s10208-007-9004-yopenalex-snapshot
Semidefinite Characterization and Computation of Zero-Dimensional Real Radical Ideals
inferred← citeshttps://doi.org/10.1007/s10208-012-9132-xopenalex-snapshot
A Semidefinite Approach for Truncated K-Moment Problems
inferred← citeshttps://doi.org/10.1007/s10208-014-9225-9openalex-snapshot
The $${\mathcal {A}}$$ A -Truncated $$K$$ K -Moment Problem
inferred← citeshttps://doi.org/10.1007/s10208-021-09526-8openalex-snapshot
The Saddle Point Problem of Polynomials
inferred← citeshttps://doi.org/10.1007/s10208-022-09552-0openalex-snapshot
An Echelon Form of Weakly Infeasible Semidefinite Programs and Bad Projections of the psd Cone
inferred← citeshttps://doi.org/10.1007/s10444-016-9456-1openalex-snapshot
Lebesgue decomposition in action via semidefinite relaxations
inferred← citeshttps://doi.org/10.1007/s10589-007-9131-zopenalex-snapshot
Sum of squares method for sensor network localization
inferred← citeshttps://doi.org/10.1007/s10589-011-9437-8openalex-snapshot
Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization
inferred← citeshttps://doi.org/10.1007/s10589-013-9612-1openalex-snapshot
Semidefinite relaxations for semi-infinite polynomial programming
inferred← citeshttps://doi.org/10.1007/s10589-016-9870-9openalex-snapshot
A semidefinite algorithm for completely positive tensor decomposition
inferred← citeshttps://doi.org/10.1007/s10589-017-9973-yopenalex-snapshot
Real eigenvalues of nonsymmetric tensors
inferred← citeshttps://doi.org/10.1007/s10589-018-0003-5openalex-snapshot
Completely positive tensor recovery with minimal nuclear value
inferred← citeshttps://doi.org/10.1007/s10589-019-00066-0openalex-snapshot
A new approximation hierarchy for polynomial conic optimization
inferred← citeshttps://doi.org/10.1007/s10589-020-00242-7openalex-snapshot
The Gauss–Seidel method for generalized Nash equilibrium problems of polynomials
inferred← citeshttps://doi.org/10.1007/s10589-021-00311-5openalex-snapshot
On solving a class of fractional semi-infinite polynomial programming problems
inferred← citeshttps://doi.org/10.1007/s10589-021-00325-zopenalex-snapshot
A sublevel moment-SOS hierarchy for polynomial optimization
inferred← citeshttps://doi.org/10.1007/s10589-022-00361-3openalex-snapshot
Local saddle points for unconstrained polynomial optimization
inferred← citeshttps://doi.org/10.1007/s10589-024-00635-yopenalex-snapshot
Solving polynomial variational inequality problems via Lagrange multiplier expressions and Moment-SOS relaxations
inferred← citeshttps://doi.org/10.1007/s10589-025-00657-0openalex-snapshot
All saddle points for polynomial optimization
inferred← citeshttps://doi.org/10.1007/s10589-026-00782-4openalex-snapshot
Tractable hierarchies of convex relaxations for polynomial optimization on the nonnegative orthant
inferred← citeshttps://doi.org/10.1007/s10898-006-9119-8openalex-snapshot
Global minimization of rational functions and the nearest GCDs
inferred← citeshttps://doi.org/10.1007/s10898-007-9244-zopenalex-snapshot
Global optimization of robust chance constrained problems
inferred← citeshttps://doi.org/10.1007/s10898-008-9394-7openalex-snapshot
Moments and sums of squares for polynomial optimization and related problems
inferred← citeshttps://doi.org/10.1007/s10898-013-0047-0openalex-snapshot
Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities
inferred← citeshttps://doi.org/10.1007/s10898-015-0309-0openalex-snapshot
Interiors of completely positive cones
inferred← citeshttps://doi.org/10.1007/s10898-017-0592-zopenalex-snapshot
Tensor maximal correlation problems
inferred← citeshttps://doi.org/10.1007/s10898-019-00751-8openalex-snapshot
A hierarchy of semidefinite relaxations for completely positive tensor optimization problems
inferred← citeshttps://doi.org/10.1007/s10898-020-00969-xopenalex-snapshot
Multi-objective convex polynomial optimization and semidefinite programming relaxations
inferred← citeshttps://doi.org/10.1007/s10898-022-01148-wopenalex-snapshot
Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space
inferred← citeshttps://doi.org/10.1007/s10898-023-01313-9openalex-snapshot
Hausdorff distance between convex semialgebraic sets
inferred← citeshttps://doi.org/10.1007/s10898-024-01421-0openalex-snapshot
Hierarchy relaxations for robust equilibrium constrained polynomial problems and applications to electric vehicle charging scheduling
inferred← citeshttps://doi.org/10.1007/s10898-025-01530-4openalex-snapshot
Optimal transport-based distributionally robust optimization with polynomial uncertainty
inferred← citeshttps://doi.org/10.1007/s10898-025-01539-9openalex-snapshot
Sparse polynomial optimization with matrix constraints
inferred← citeshttps://doi.org/10.1007/s10915-023-02138-0openalex-snapshot
On the Polyhedral Homotopy Method for Solving Generalized Nash Equilibrium Problems of Polynomials
inferred← citeshttps://doi.org/10.1007/s10957-008-9473-4openalex-snapshot
An Algorithm for the Global Optimization of a Class of Continuous Minimax Problems
inferred← citeshttps://doi.org/10.1007/s11081-025-10000-5openalex-snapshot
Term-sparse polynomial optimization for the design of frame structures
inferred← citeshttps://doi.org/10.1007/s11222-018-9834-2openalex-snapshot
T-optimal designs for multi-factor polynomial regression models via a semidefinite relaxation method
inferred← citeshttps://doi.org/10.1007/s11263-006-0015-yopenalex-snapshot
Globally Optimal Estimates for Geometric Reconstruction Problems
inferred← citeshttps://doi.org/10.1007/s11424-023-1406-7openalex-snapshot
VerifyRealRoots: A Matlab Package for Computing Verified Real Solutions of Polynomials Systems of Equations and Inequalities
inferred← citeshttps://doi.org/10.1007/s11425-014-4959-zopenalex-snapshot
Partially positive matrices
inferred← citeshttps://doi.org/10.1007/s11425-017-9437-2openalex-snapshot
Completely positive tensors in the complex field
inferred← citeshttps://doi.org/10.1007/s11590-011-0384-1openalex-snapshot
How to generate weakly infeasible semidefinite programs via Lasserre’s relaxations for polynomial optimization
inferred← citeshttps://doi.org/10.1007/s11590-015-0868-5openalex-snapshot
Strong duality in Lasserre’s hierarchy for polynomial optimization
inferred← citeshttps://doi.org/10.1007/s11590-026-02285-xopenalex-snapshot
Approximating the order 2 quantum Wasserstein distance using the moment-SOS hierarchy
inferred← citeshttps://doi.org/10.1007/s12532-019-00164-4openalex-snapshot
Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs
inferred← citeshttps://doi.org/10.1007/s12532-023-00243-7openalex-snapshot
A hierarchy of spectral relaxations for polynomial optimization
inferred← citeshttps://doi.org/10.1007/s13675-015-0050-yopenalex-snapshot
A bounded degree SOS hierarchy for polynomial optimization
inferred← citeshttps://doi.org/10.1007/s40305-021-00347-8openalex-snapshot
Certifying the Global Optimality of Quartic Minimization over the Sphere
inferred← citeshttps://doi.org/10.1016/j.adhoc.2018.10.017openalex-snapshot
Frame-based randomized scheduling of packets with random-deadlines for multi-flow wireless networks
inferred← citeshttps://doi.org/10.1016/j.automatica.2007.03.015openalex-snapshot
Establishing tightness in robust H∞ analysis via homogeneous parameter-dependent Lyapunov functions
inferred← citeshttps://doi.org/10.1016/j.automatica.2013.09.021openalex-snapshot
An SDP approach for ℓ 0 -minimization: Application to ARX model segmentation
inferred← citeshttps://doi.org/10.1016/j.automatica.2014.04.027openalex-snapshot
On the structure of generalized plant convexifying static H∞ control problems
inferred← citeshttps://doi.org/10.1016/j.automatica.2014.09.003openalex-snapshot
Design of Marx generators as a structured eigenvalue assignment
inferred← citeshttps://doi.org/10.1016/j.automatica.2014.12.007openalex-snapshot
Minimizing trigonometric matrix polynomials over semi-algebraic sets
inferred← citeshttps://doi.org/10.1016/j.ifacol.2015.09.286openalex-snapshot
Necessary Conditions for 2D Systems' Stability∗∗This work has been supported by Ministry of Education and Science of Russia, grant 2.1748.2014/K.
inferred← citeshttps://doi.org/10.1016/j.ifacol.2015.09.429openalex-snapshot
Necessary Conditions for Robust Stability of Linear Systems∗∗##
inferred← citeshttps://doi.org/10.1016/j.ifacol.2015.09.443openalex-snapshot
Application of Facial Reduction to H∞ State Feedback Control Problem∗∗The first author was supported by JSPS KAKENHI Grant Numbers 22740056 and 26400203.
inferred← citeshttps://doi.org/10.1016/j.ifacol.2016.07.924openalex-snapshot
On H∞ and H2 Performance of 2D Systems**This work has been supported by Ministry of Education and Science of Russia, grant 2.1748.2014/K.
inferred← citeshttps://doi.org/10.1016/j.ifacol.2017.08.2139openalex-snapshot
Static Output Feedback Stabilization of 2D Systems via Dual Problems
inferred← citeshttps://doi.org/10.1016/j.ifacol.2024.10.160openalex-snapshot
Stability Analysis of Feedback Systems with ReLU Nonlinearities via Semialgebraic Set Representation
inferred← citeshttps://doi.org/10.1016/j.ijepes.2015.02.018openalex-snapshot
Global optimization for power dispatch problems based on theory of moments
inferred← citeshttps://doi.org/10.1016/j.jat.2024.106116openalex-snapshot
Optimization-aided construction of multivariate Chebyshev polynomials
inferred← citeshttps://doi.org/10.1016/j.jfranklin.2015.03.021openalex-snapshot
An obstacle avoidance model predictive control scheme for mobile robots subject to nonholonomic constraints: A sum-of-squares approach
inferred← citeshttps://doi.org/10.1016/j.jpaa.2006.05.028openalex-snapshot
Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
inferred← citeshttps://doi.org/10.1016/j.jsc.2011.08.002openalex-snapshot
Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients
inferred← citeshttps://doi.org/10.1016/j.jsc.2015.08.004openalex-snapshot
Border basis relaxation for polynomial optimization
inferred← citeshttps://doi.org/10.1016/j.jsc.2023.102241openalex-snapshot
Algebraic optimization of sequential decision problems
inferred← citeshttps://doi.org/10.1016/j.jsc.2024.102403openalex-snapshot
Exact Moment Representation in Polynomial Optimization
inferred← citeshttps://doi.org/10.1016/j.laa.2015.08.002openalex-snapshot
Monotonically positive matrices
inferred← citeshttps://doi.org/10.1016/j.laa.2020.06.007openalex-snapshot
Hermitian completely positive matrices
inferred← citeshttps://doi.org/10.1016/j.sigpro.2020.107835openalex-snapshot
Sparse signal reconstruction for nonlinear models via piecewise rational optimization
inferred← citeshttps://doi.org/10.1016/j.sysconle.2009.04.002openalex-snapshot
A recursive algorithm of exactness verification of relaxations for robust SDPs
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.09.003openalex-snapshot
Approximate GCDs of polynomials and sparse SOS relaxations
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.03.024openalex-snapshot
A prolongation–projection algorithm for computing the finite real variety of an ideal
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)30455-xopenalex-snapshot
Model Predictive Control for Discrete Time Polynomial Control Systems: A Convex Approach
inferred← citeshttps://doi.org/10.1017/s0962492904000194openalex-snapshot
Complete search in continuous global optimization and constraint satisfaction
inferred← citeshttps://doi.org/10.1051/cocv/2024053openalex-snapshot
Symmetry reduction and recovery of trajectories of optimal control problems via measure relaxations
inferred← citeshttps://doi.org/10.1080/00207179.2017.1351625openalex-snapshot
Application of facial reduction to H ∞ state feedback control problem
inferred← citeshttps://doi.org/10.1080/03081087.2021.1965078openalex-snapshot
Separability of Hermitian tensors and PSD decompositions
inferred← citeshttps://doi.org/10.1080/10556788.2010.544312openalex-snapshot
NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials
inferred← citeshttps://doi.org/10.1080/10556788.2015.1052969openalex-snapshot
Perturbed sums-of-squares theorem for polynomial optimization and its applications
inferred← citeshttps://doi.org/10.1080/10556788.2015.1121489openalex-snapshot
GpoSolver: a Matlab/C++ toolbox for global polynomial optimization
inferred← citeshttps://doi.org/10.1080/10556788.2018.1528251openalex-snapshot
The maximum tensor complementarity eigenvalues
inferred← citeshttps://doi.org/10.1088/1367-2630/15/2/023026openalex-snapshot
A paradox in bosonic energy computations via semidefinite programming relaxations
inferred← citeshttps://doi.org/10.1090/s0002-9939-05-08133-5openalex-snapshot
Revisiting two theorems of Curto and Fialkow on moment matrices
inferred← citeshttps://doi.org/10.1090/tran/8648openalex-snapshot
Noncommutative Christoffel-Darboux kernels
inferred← citeshttps://doi.org/10.1103/revmodphys.96.045006openalex-snapshot
Semidefinite programming relaxations for quantum correlations
inferred← citeshttps://doi.org/10.1109/acc.2011.5990950openalex-snapshot
Identifying stable fixed order systems from time and frequency response data
inferred← citeshttps://doi.org/10.1109/acc.2012.6314709openalex-snapshot
A convex approach to generalized fixed order interpolation
inferred← citeshttps://doi.org/10.1109/access.2018.2851392openalex-snapshot
Resource Modeling and Scheduling for Mobile Edge Computing: A Service Provider’s Perspective
inferred← citeshttps://doi.org/10.1109/access.2020.2966566openalex-snapshot
Application of Sum-of-Squares Method in Estimation of Region of Attraction for Nonlinear Polynomial Systems
inferred← citeshttps://doi.org/10.1109/cacsd.2010.5612663openalex-snapshot
Exactness verification of upper-bound relaxations derived via parameter-dependent multipliers for rational uncertainty blocks
inferred← citeshttps://doi.org/10.1109/camsap.2015.7383798openalex-snapshot
Optimization of a Geman-McClure like criterion for sparse signal deconvolution
inferred← citeshttps://doi.org/10.1109/cdc.2002.1184595openalex-snapshot
GloptiPoly: global optimization over polynomials with Matlab and SeDuMi
inferred← citeshttps://doi.org/10.1109/cdc.2005.1582432openalex-snapshot
Network Utility Maximization With Nonconcave Utilities Using Sum-of-Squares Method
inferred← citeshttps://doi.org/10.1109/cdc.2006.377719openalex-snapshot
Rank Minimization Using Sums of Squares of Nonnegative Matrices
inferred← citeshttps://doi.org/10.1109/cdc.2007.4434124openalex-snapshot
Robust performance analysis of uncertain LTI systems: Dual LMI approach and verifications for exactness
inferred← citeshttps://doi.org/10.1109/cdc.2008.4738716openalex-snapshot
Periodically time-varying dynamical controller synthesis for polytopic-type uncertain discrete-time linear systems
inferred← citeshttps://doi.org/10.1109/cdc.2009.5399826openalex-snapshot
Constructing a sequence of relaxation problems for robustness analysis of uncertain LTI systems via dual LMIs
inferred← citeshttps://doi.org/10.1109/cdc.2010.5717776openalex-snapshot
Asymptotic exactness of dual LMI approach for robust performance analysis of uncertain LTI systems
inferred← citeshttps://doi.org/10.1109/cdc.2010.5718082openalex-snapshot
Hybrid system identification: An SDP approach
inferred← citeshttps://doi.org/10.1109/cdc40024.2019.9029656openalex-snapshot
Random Coordinate Minimization Method with Eventual Transverse Directions for Constrained Polynomial Optimization
inferred← citeshttps://doi.org/10.1109/cdc49753.2023.10383232openalex-snapshot
Multivariate Polynomial Optimization in Complex Variables Is a (Rectangular) Multiparameter Eigenvalue Problem
inferred← citeshttps://doi.org/10.1109/cdc49753.2023.10383434openalex-snapshot
Verification and Synthesis of Robust Control Barrier Functions: Multilevel Polynomial Optimization and Semidefinite Relaxation
inferred← citeshttps://doi.org/10.1109/cdc57313.2025.11312722openalex-snapshot
Safety-Oriented Vulnerability Assessment of Discrete-Time Interconnected Control Systems
inferred← citeshttps://doi.org/10.1109/cvpr.2010.5540075openalex-snapshot
GPCA with denoising: A moments-based convex approach
inferred← citeshttps://doi.org/10.1109/cvpr.2010.5540219openalex-snapshot
Polynomial shape from shading
inferred← citeshttps://doi.org/10.1109/icassp.2019.8683692openalex-snapshot
How to Globally Solve Non-convex Optimization Problems Involving an Approximate ℓ0 Penalization
inferred← citeshttps://doi.org/10.1109/icassp39728.2021.9413383openalex-snapshot
Weight Identification Through Global Optimization in a New Hysteretic Neural Network Model
inferred← citeshttps://doi.org/10.1109/icassp40776.2020.9054186openalex-snapshot
A Moment-Based Approach for Guaranteed Tensor Decomposition
inferred← citeshttps://doi.org/10.1109/iccv.2005.109openalex-snapshot
Globally optimal estimates for geometric reconstruction problems
inferred← citeshttps://doi.org/10.1109/infcom.2010.5462065openalex-snapshot
Optimal SINR-based Random Access
inferred← citeshttps://doi.org/10.1109/lcsys.2020.3047591openalex-snapshot
Peak Estimation and Recovery with Occupation Measures
inferred← citeshttps://doi.org/10.1109/lra.2022.3163444openalex-snapshot
Globally Optimal Solution to Inverse Kinematics of 7DOF Serial Manipulator
inferred← citeshttps://doi.org/10.1109/lra.2024.3360809openalex-snapshot
Geometry-Aware Safety-Critical Local Reactive Controller for Robot Navigation in Unknown and Cluttered Environments
inferred← citeshttps://doi.org/10.1109/lsp.2020.2998699openalex-snapshot
Global Optimization for Recovery of Clipped Signals Corrupted With Poisson-Gaussian Noise
inferred← citeshttps://doi.org/10.1109/mcas.2008.931737openalex-snapshot
Convex relaxations in circuits, systems, and control
inferred← citeshttps://doi.org/10.1109/mcs.2004.1299534openalex-snapshot
Solving nonconvex optimization problems
inferred← citeshttps://doi.org/10.1109/med.2009.5164727openalex-snapshot
Polynomial methods in noisy network localization
inferred← citeshttps://doi.org/10.1109/mlsp49062.2020.9231524openalex-snapshot
Robust Reconstruction with Nonconvex Subset Constraints: A Polynomial Optimization Approach
inferred← citeshttps://doi.org/10.1109/mmar.2016.7575312openalex-snapshot
On evaluating H∞ and H2 performance of uncertain systems
inferred← citeshttps://doi.org/10.1109/tac.2005.863494openalex-snapshot
Convergent Relaxations of Polynomial Matrix Inequalities and Static Output Feedback
inferred← citeshttps://doi.org/10.1109/tac.2008.921045openalex-snapshot
Analysis and Synthesis of Nonlinear Systems With Uncertain Initial Conditions
inferred← citeshttps://doi.org/10.1109/tac.2009.2017086openalex-snapshot
Robust Performance Analysis of Uncertain LTI Systems: Dual LMI Approach and Verifications for Exactness
inferred← citeshttps://doi.org/10.1109/tac.2010.2044268openalex-snapshot
A Nonlinear Sum-of-Squares Model Predictive Control Approach
inferred← citeshttps://doi.org/10.1109/tac.2015.2438452openalex-snapshot
Computation of the Structured Singular Value via Moment LMI Relaxations
inferred← citeshttps://doi.org/10.1109/tac.2016.2555701openalex-snapshot
Convex Synthesis of Robust Controllers for Linear Systems With Polytopic Time-Varying Uncertainty
inferred← citeshttps://doi.org/10.1109/tac.2016.2585743openalex-snapshot
Stabilization and Entropy Reduction via SDP-Based Design of Fixed-Order Output Feedback Controllers and Tuning Parameters
inferred← citeshttps://doi.org/10.1109/tac.2023.3313351openalex-snapshot
Learning of Linear Dynamical Systems as a Noncommutative Polynomial Optimization Problem
inferred← citeshttps://doi.org/10.1109/taes.2011.5937274openalex-snapshot
Cooperative Self-Localization of Mobile Agents
inferred← citeshttps://doi.org/10.1109/taes.2013.6404102openalex-snapshot
Doppler Shift Target Localization
inferred← citeshttps://doi.org/10.1109/tcsii.2008.2008072openalex-snapshot
Tightness Conditions for Semidefinite Relaxations of Forms Minimization
inferred← citeshttps://doi.org/10.1109/tcst.2026.3662319openalex-snapshot
On the SDP Relaxation of Direct Torque Finite Control Set Model Predictive Control
inferred← citeshttps://doi.org/10.1109/tsp.2018.2890065openalex-snapshot
Rational Optimization for Nonlinear Reconstruction With Approximate $\ell _0$ Penalization
inferred← citeshttps://doi.org/10.1109/tsp.2021.3115951openalex-snapshot
Optimal Feature Manipulation Attacks Against Linear Regression
inferred← citeshttps://doi.org/10.1115/1.4042176openalex-snapshot
Sparse Sum-of-Squares Optimization for Model Updating Through Minimization of Modal Dynamic Residuals
inferred← citeshttps://doi.org/10.1134/s0005117913120096openalex-snapshot
Atomic optimization. I. Search Space Transformation and One-dimensional Problems
inferred← citeshttps://doi.org/10.1134/s0005117914060150openalex-snapshot
Atomic optimization. II. Multidimensional problems and polynomial matrix inequalities
inferred← citeshttps://doi.org/10.1134/s0005117917050150openalex-snapshot
Dual form reduction in the atomic optimization method
inferred← citeshttps://doi.org/10.1134/s0005117918030013openalex-snapshot
On Calculation of Norms of 2D-systems
inferred← citeshttps://doi.org/10.1137/04060562xopenalex-snapshot
Semidefinite Approximations for Global Unconstrained Polynomial Optimization
inferred← citeshttps://doi.org/10.1137/050623802openalex-snapshot
Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
inferred← citeshttps://doi.org/10.1137/05063129xopenalex-snapshot
Transposition Theorems and Qualification‐Free Optimality Conditions
inferred← citeshttps://doi.org/10.1137/05064504xopenalex-snapshot
Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
inferred← citeshttps://doi.org/10.1137/060668791openalex-snapshot
Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
inferred← citeshttps://doi.org/10.1137/110825844openalex-snapshot
Regularization Methods for SDP Relaxations in Large-Scale Polynomial Optimization
inferred← citeshttps://doi.org/10.1137/15m1012086openalex-snapshot
The CP-Matrix Approximation Problem
inferred← citeshttps://doi.org/10.1137/16m1109060openalex-snapshot
A Multigrid Approach to SDP Relaxations of Sparse Polynomial Optimization Problems
inferred← citeshttps://doi.org/10.1137/18m1225677openalex-snapshot
In SDP Relaxations, Inaccurate Solvers Do Robust Optimization
inferred← citeshttps://doi.org/10.1137/21m1456285openalex-snapshot
Rational Generalized Nash Equilibrium Problems
inferred← citeshttps://doi.org/10.1137/22m1515689openalex-snapshot
A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization
inferred← citeshttps://doi.org/10.1137/23m1614808openalex-snapshot
The Multivariate Eigenvalues of Symmetric Tensors
inferred← citeshttps://doi.org/10.1137/23m1615516openalex-snapshot
Towards Global Solutions for Nonconvex Two-Stage Stochastic Programs: A Polynomial Lower Approximation Approach
inferred← citeshttps://doi.org/10.1137/24m1636010openalex-snapshot
Sparse Polynomial Optimization with Unbounded Sets
inferred← citeshttps://doi.org/10.1137/24m1711935openalex-snapshot
Conjugate Partial-Symmetric Tensors
inferred← citeshttps://doi.org/10.1137/25m1739716openalex-snapshot
Convergence Rate for Linear Minimizer-Estimators in the Moment-Sum-of-Squares Hierarchy
inferred← citeshttps://doi.org/10.1137/s0895479803430953openalex-snapshot
Relaxations for Robust Linear Matrix Inequality Problems with Verifications for Exactness
inferred← citeshttps://doi.org/10.1142/s0217595910002533openalex-snapshot
SDP RELAXATIONS FOR QUADRATIC OPTIMIZATION PROBLEMS DERIVED FROM POLYNOMIAL OPTIMIZATION PROBLEMS
showing the first 200 of 256 · page through all 256
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.