The following pages link to Janez Povh (Q249529):
Displaying 50 items.
- New heuristics for the vertex coloring problem based on semidefinite programming (Q351547) (← links)
- Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials (Q354616) (← links)
- On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets (Q360522) (← links)
- Erratum to: ``On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets'' (Q360523) (← links)
- Moment approximations for set-semidefinite polynomials (Q382904) (← links)
- Semidefinite approximations for quadratic programs over orthogonal matrices (Q609564) (← links)
- Copositive and semidefinite relaxations of the quadratic assignment problem (Q834180) (← links)
- Semidefinite programming and sums of Hermitian squares of noncommutative polynomials (Q847674) (← links)
- A boundary point method to solve semidefinite programs (Q858180) (← links)
- The tracial moment problem and trace-optimization of polynomials (Q1942272) (← links)
- Methodologies and applications for resilient global development from the aspect of SDI-SOR special issues of CJOR (Q2051177) (← links)
- On sufficient properties of sufficient matrices (Q2051181) (← links)
- Four algorithms to solve symmetric multi-type non-negative matrix tri-factorization problem (Q2114581) (← links)
- Clustering as a dual problem to colouring (Q2140780) (← links)
- Sparse noncommutative polynomial optimization (Q2144551) (← links)
- \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM (Q2231040) (← links)
- On an extension of Pólya's Positivstellensatz (Q2342945) (← links)
- A new approximation hierarchy for polynomial conic optimization (Q2419540) (← links)
- Optimization of Polynomials in Non-Commuting Variables (Q2803374) (← links)
- (Q2903231) (← links)
- (Q2903232) (← links)
- Constrained Polynomial Optimization Problems with Noncommuting Variables (Q2910876) (← links)
- (Q2943931) (← links)
- (Q2943946) (← links)
- (Q2943947) (← links)
- (Q2966411) (← links)
- NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials (Q3093048) (← links)
- From combinatorial optimization to real algebraic geometry and back (Q3455964) (← links)
- Rational sums of hermitian squares of free noncommutative polynomials (Q3465661) (← links)
- (Q3575761) (← links)
- (Q3575768) (← links)
- (Q3656591) (← links)
- (Q4547462) (← links)
- Minimizer Extraction in Polynomial Optimization Is Robust (Q4561225) (← links)
- (Q4674154) (← links)
- Contribution of copositive formulations to the graph partitioning problem (Q4916308) (← links)
- Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction (Q4971018) (← links)
- Collective dynamics of phase-repulsive oscillators solves graph coloring problem (Q5112986) (← links)
- BiqBin: Moving Boundaries for NP-hard Problems by HPC (Q5119114) (← links)
- Regularization Methods for Semidefinite Programming (Q5189563) (← links)
- A note on the nonexistence of sum of squares certificates for the Bessis–Moussa–Villani conjecture (Q5253730) (← links)
- (Q5310603) (← links)
- A Copositive Programming Approach to Graph Partitioning (Q5444289) (← links)
- (Q5446939) (← links)
- (Q5446952) (← links)
- (Q5482472) (← links)
- (Q5748011) (← links)
- BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints (Q5883708) (← links)
- Constrained trace-optimization of polynomials in freely noncommuting variables (Q5964245) (← links)
- Solving SDP relaxations of max-cut problem with large number of hypermetric inequalities by L-BFGS-B (Q6155645) (← links)
