Janez Povh

Orcid: 0000-0002-9856-1476

According to our database1, Janez Povh authored at least 46 papers between 2006 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Sufficient Matrices: Properties, Generating and Testing.
J. Optim. Theory Appl., July, 2024

Certifying Optimality of Bell Inequality Violations: Noncommutative Polynomial Optimization through Semidefinite Programming and Local Optimization.
SIAM J. Optim., 2024

2023
60 years of OR in Slovenia: development from a first conference to a vibrant community.
Central Eur. J. Oper. Res., September, 2023

Electricity consumption prediction using artificial intelligence.
Central Eur. J. Oper. Res., September, 2023

Solving SDP relaxations of Max-Cut problem with large number of hypermetric inequalities by L-BFGS-B.
Optim. Lett., June, 2023

2022
Clustering as a dual problem to colouring.
Comput. Appl. Math., June, 2022

BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints.
ACM Trans. Math. Softw., 2022

Sparse noncommutative polynomial optimization.
Math. Program., 2022

Four algorithms to solve symmetric multi-type non-negative matrix tri-factorization problem.
J. Glob. Optim., 2022

Data-driven engineering design: A systematic review using scientometric approach.
Adv. Eng. Informatics, 2022

2021
MADAM: a parallel exact solver for max-cut based on semidefinite programming and ADMM.
Comput. Optim. Appl., 2021

On sufficient properties of sufficient matrices.
Central Eur. J. Oper. Res., 2021

Methodologies and applications for resilient global development from the aspect of SDI-SOR special issues of CJOR.
Central Eur. J. Oper. Res., 2021

Modeling Public Transport Network System by Using Statistics, Network Theory and Ant Colony Optimization.
Comput. Informatics, 2021

2020
The Impact of the Complexity of Harmony on the Acceptability of Music.
ACM Trans. Appl. Percept., 2020

Feasible Corrector-Predictor Interior-Point Algorithm for P<sub>*</sub> (κ)-Linear Complementarity Problems Based on a New Search Direction.
SIAM J. Optim., 2020

A Block Coordinate Descent-based Projected Gradient Algorithm for Orthogonal Non-negative Matrix Factorization.
CoRR, 2020

AI based algorithms for the detection of (ir)regularity in musical structure.
Int. J. Appl. Math. Comput. Sci., 2020

Public transport analyzing using bee colony.
Proceedings of the 43rd International Convention on Information, 2020

2019
A new approximation hierarchy for polynomial conic optimization.
Comput. Optim. Appl., 2019

BiqBin: Moving Boundaries for NP-hard Problems by HPC.
Proceedings of the Advances in High Performance Computing, 2019

2018
Minimizer Extraction in Polynomial Optimization Is Robust.
SIAM J. Optim., 2018

Is science driven by principal investigators?
Scientometrics, 2018

Annotated news corpora and a lexicon for sentiment analysis in Slovene.
Lang. Resour. Evaluation, 2018

2017
Analysis of Slovenian research community through bibliographic networks.
Scientometrics, 2017

Editorial.
Central Eur. J. Oper. Res., 2017

2016
Constrained trace-optimization of polynomials in freely noncommuting variables.
J. Glob. Optim., 2016

2015
On an extension of Pólya's Positivstellensatz.
J. Glob. Optim., 2015

Rational sums of hermitian squares of free noncommutative polynomials.
Ars Math. Contemp., 2015

Text Detection in Document Images by Machine Learning Algorithms.
Proceedings of the 9th International Conference on Computer Recognition Systems CORES 2015, 2015

Sentiment Classification of the Slovenian News Texts.
Proceedings of the 9th International Conference on Computer Recognition Systems CORES 2015, 2015

2014
Community structure and the evolution of interdisciplinarity in Slovenia's scientific collaboration network.
CoRR, 2014

2013
On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets.
Optim. Lett., 2013

Erratum to: On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets.
Optim. Lett., 2013

The tracial moment problem and trace-optimization of polynomials.
Math. Program., 2013

Moment Approximations for Set-Semidefinite Polynomials.
J. Optim. Theory Appl., 2013

Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials.
Comput. Optim. Appl., 2013

New heuristics for the vertex coloring problem based on semidefinite programming.
Central Eur. J. Oper. Res., 2013

2012
Constrained Polynomial Optimization Problems with Noncommuting Variables.
SIAM J. Optim., 2012

2011
NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials.
Optim. Methods Softw., 2011

Editorial.
Central Eur. J. Oper. Res., 2011

2010
Semidefinite approximations for quadratic programs over orthogonal matrices.
J. Glob. Optim., 2010

2009
Regularization Methods for Semidefinite Programming.
SIAM J. Optim., 2009

Copositive and semidefinite relaxations of the quadratic assignment problem.
Discret. Optim., 2009

2007
A Copositive Programming Approach to Graph Partitioning.
SIAM J. Optim., 2007

2006
A Boundary Point Method to Solve Semidefinite Programs.
Computing, 2006


  Loading...