Julien Ugon

Orizon Pereira Ferreira

Comput. Optim. Appl., November, 2024

The linkedness of cubical polytopes: Beyond the cube.

[BibT_eX]

[DOI]

Hoa T. Bui

Discret. Math., March, 2024

Uniqueness of solutions in multivariate Chebyshev approximation problems.

[BibT_eX]

[DOI]

Vera Roshchina

Optim. Lett., January, 2024

2023

Edge connectivity of simplicial polytopes.

[BibT_eX]

[DOI]

Vincent Pilaud

Eur. J. Comb., October, 2023

Approximate Douglas-Rachford algorithm for two-sets convex feasibility problems.

[BibT_eX]

[DOI]

Orizon Pereira Ferreira

J. Glob. Optim., July, 2023

Frank-Wolfe algorithm for DC optimization problem.

[BibT_eX]

[DOI]

Orizon P. Ferreira

CoRR, 2023

A comparison of rational and neural network based approximations.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Structural-functional connectivity bandwidth of the human brain.

[BibT_eX]

[DOI]

NeuroImage, 2022

Finding Maximum Cliques in Large Networks.

[BibT_eX]

[DOI]

Su Yuan Chan

Kerri Morgan

CoRR, 2022

Minimum Number of Edges of Polytopes with $2d+2$ Vertices.

[BibT_eX]

[DOI]

Electron. J. Comb., 2022

Linkedness of Cartesian products of complete graphs.

[BibT_eX]

[DOI]

Leif K. Jørgensen

Ars Math. Contemp., 2022

A generalisation of de la Vallée-Poussin procedure to multivariate approximations.

[BibT_eX]

[DOI]

Adv. Comput. Math., 2022

2021

Supernodes.

[BibT_eX]

[DOI]

CoRR, 2021

Flexible rational approximation for matrix functions.

[BibT_eX]

[DOI]

CoRR, 2021

Supernodes: a generalization of the rich-club.

[BibT_eX]

[DOI]

J. Complex Networks, 2021

The Linkedness of Cubical Polytopes: The Cube.

[BibT_eX]

[DOI]

Hoa T. Bui

Electron. J. Comb., 2021

Generalised rational approximation and its application to improve deep learning classifiers.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2021

2020

Connectivity of cubical polytopes.

[BibT_eX]

[DOI]

Hoa T. Bui

J. Comb. Theory A, 2020

Polytopes Close to Being Simple.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2020

An algorithm for best generalised rational approximation of continuous functions.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Lower bound theorems for general polytopes.

[BibT_eX]

[DOI]

Eur. J. Comb., 2019

On the Reconstruction of Polytopes.

[BibT_eX]

[DOI]

Joseph Doolittle

Eran Nevo

Discret. Comput. Geom., 2019

2018

The Excess Degree of a Polytope.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms.

[BibT_eX]

[DOI]

Optim. Methods Softw., 2018

2017

Characterization Theorem for Best Polynomial Spline Approximation with Free Knots, Variable Degree and Fixed Tails.

[BibT_eX]

[DOI]

Jean-Pierre Crouzeix

J. Optim. Theory Appl., 2017

An Agile Group Aware Process beyond CRISP-DM: A Hospital Data Mining Case Study.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Compute and Data Analysis, 2017

Detection of Outlier Behaviour Amongst Health/Medical Providers Servicing TAC Clients.

[BibT_eX]

[DOI]

Musa Mammadov

Rob Muspratt

Proceedings of the Data Mining, 2017

2016

Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems.

[BibT_eX]

[DOI]

Sona Taheri

Pattern Recognit., 2016

Chebyshev Approximation by Linear Combinations of Fixed Knot Polynomial Splines with Weighting Functions.

[BibT_eX]

[DOI]

J. Optim. Theory Appl., 2016

2015

An algorithm for clusterwise linear regression based on smoothing techniques.

[BibT_eX]

[DOI]

Hijran G. Mirzayeva

Optim. Lett., 2015

Patient admission prediction using a pruned fuzzy min-max neural network with rule extraction.

[BibT_eX]

[DOI]

Neural Comput. Appl., 2015

Nonsmooth Optimization Algorithm for Solving Clusterwise Linear Regression Problems.

[BibT_eX]

[DOI]

Hijran G. Mirzayeva

J. Optim. Theory Appl., 2015

Global optimality conditions and optimization methods for polynomial programming problems.

[BibT_eX]

[DOI]

Zhi-You Wu

J. Tian

J. Glob. Optim., 2015

Global optimality conditions and optimization methods for constrained polynomial programming problems.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2015

2014

Optimality conditions and optimization methods for quartic polynomial optimization.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2014

2013

Nonsmooth nonconvex optimization approach to clusterwise linear regression problems.

[BibT_eX]

[DOI]

Hijran G. Mirzayeva

Eur. J. Oper. Res., 2013

2012

A modified parallel optimization system for updating large-size time-evolving flow matrix.

[BibT_eX]

[DOI]

Ting Yu

Wei Yu

Inf. Sci., 2012

Computational Complexity, NP Completeness and Optimization Duality: A Survey.

[BibT_eX]

[DOI]

Prabhu Manyem

Electron. Colloquium Comput. Complex., 2012

2011

Fast modified global k-means algorithm for incremental cluster construction.

[BibT_eX]

[DOI]

Dean Webb

Pattern Recognit., 2011

Classification through incremental max-min separability.

[BibT_eX]

[DOI]

Pattern Anal. Appl., 2011

Codifferential method for minimizing nonsmooth DC functions.

[BibT_eX]

[DOI]

J. Glob. Optim., 2011

An efficient algorithm for the incremental construction of a piecewise linear classifier.

[BibT_eX]

[DOI]

Dean Webb

Inf. Syst., 2011

2009

Workload coverage through nonsmooth optimization.

[BibT_eX]

[DOI]

John Yearwood

Optim. Methods Softw., 2009

2006

Piecewise Partially Separable Functions and a Derivative-free Algorithm for Large Scale Nonsmooth Optimization.

[BibT_eX]

[DOI]

J. Glob. Optim., 2006

Classes and clusters in data analysis.

[BibT_eX]

[DOI]

Alex M. Rubinov

N. V. Soukhorokova