Julien Ugon

Orcid: 0000-0001-5290-8051

According to our database1, Julien Ugon authored at least 46 papers between 2005 and 2024.

Collaborative distances:



In proceedings 
PhD thesis 


On csauthors.net:


The linkedness of cubical polytopes: Beyond the cube.
Discret. Math., March, 2024

Uniqueness of solutions in multivariate Chebyshev approximation problems.
Optim. Lett., January, 2024

Edge connectivity of simplicial polytopes.
Eur. J. Comb., October, 2023

Approximate Douglas-Rachford algorithm for two-sets convex feasibility problems.
J. Glob. Optim., July, 2023

Frank-Wolfe algorithm for DC optimization problem.
CoRR, 2023

A comparison of rational and neural network based approximations.
CoRR, 2023

Structural-functional connectivity bandwidth of the human brain.
NeuroImage, 2022

Finding Maximum Cliques in Large Networks.
CoRR, 2022

Minimum Number of Edges of Polytopes with $2d+2$ Vertices.
Electron. J. Comb., 2022

Linkedness of Cartesian products of complete graphs.
Ars Math. Contemp., 2022

A generalisation of de la Vallée-Poussin procedure to multivariate approximations.
Adv. Comput. Math., 2022

CoRR, 2021

Flexible rational approximation for matrix functions.
CoRR, 2021

Supernodes: a generalization of the rich-club.
J. Complex Networks, 2021

The Linkedness of Cubical Polytopes: The Cube.
Electron. J. Comb., 2021

Generalised rational approximation and its application to improve deep learning classifiers.
Appl. Math. Comput., 2021

Connectivity of cubical polytopes.
J. Comb. Theory, Ser. A, 2020

Polytopes Close to Being Simple.
Discret. Comput. Geom., 2020

An algorithm for best generalised rational approximation of continuous functions.
CoRR, 2020

Lower bound theorems for general polytopes.
Eur. J. Comb., 2019

On the Reconstruction of Polytopes.
Discret. Comput. Geom., 2019

The Excess Degree of a Polytope.
SIAM J. Discret. Math., 2018

Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms.
Optim. Methods Softw., 2018

Characterization Theorem for Best Polynomial Spline Approximation with Free Knots, Variable Degree and Fixed Tails.
J. Optim. Theory Appl., 2017

An Agile Group Aware Process beyond CRISP-DM: A Hospital Data Mining Case Study.
Proceedings of the International Conference on Compute and Data Analysis, 2017

Detection of Outlier Behaviour Amongst Health/Medical Providers Servicing TAC Clients.
Proceedings of the Data Mining, 2017

Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems.
Pattern Recognit., 2016

Chebyshev Approximation by Linear Combinations of Fixed Knot Polynomial Splines with Weighting Functions.
J. Optim. Theory Appl., 2016

An algorithm for clusterwise linear regression based on smoothing techniques.
Optim. Lett., 2015

Patient admission prediction using a pruned fuzzy min-max neural network with rule extraction.
Neural Comput. Appl., 2015

Nonsmooth Optimization Algorithm for Solving Clusterwise Linear Regression Problems.
J. Optim. Theory Appl., 2015

Global optimality conditions and optimization methods for polynomial programming problems.
J. Glob. Optim., 2015

Global optimality conditions and optimization methods for constrained polynomial programming problems.
Appl. Math. Comput., 2015

Optimality conditions and optimization methods for quartic polynomial optimization.
Appl. Math. Comput., 2014

Nonsmooth nonconvex optimization approach to clusterwise linear regression problems.
Eur. J. Oper. Res., 2013

A modified parallel optimization system for updating large-size time-evolving flow matrix.
Inf. Sci., 2012

Computational Complexity, NP Completeness and Optimization Duality: A Survey.
Electron. Colloquium Comput. Complex., 2012

Fast modified global k-means algorithm for incremental cluster construction.
Pattern Recognit., 2011

Classification through incremental max-min separability.
Pattern Anal. Appl., 2011

Codifferential method for minimizing nonsmooth DC functions.
J. Glob. Optim., 2011

An efficient algorithm for the incremental construction of a piecewise linear classifier.
Inf. Syst., 2011

Workload coverage through nonsmooth optimization.
Optim. Methods Softw., 2009

Piecewise Partially Separable Functions and a Derivative-free Algorithm for Large Scale Nonsmooth Optimization.
J. Glob. Optim., 2006

Classes and clusters in data analysis.
Eur. J. Oper. Res., 2006

Coverage in WLAN with Minimum Number of Access Points.
Proceedings of the 63rd IEEE Vehicular Technology Conference, 2006

Optimal Placement of Access Point in WLAN Based on a New Algorithm.
Proceedings of the 2005 International Conference on Mobile Business (ICMB 2005), 2005