default search action
Julien Ugon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j36]R. Díaz Millán, Orizon Pereira Ferreira, Julien Ugon
:
Extragradient method with feasible inexact projection to variational inequality problem. Comput. Optim. Appl. 89(2): 459-484 (2024) - [j35]Hoa T. Bui
The linkedness of cubical polytopes: Beyond the cube. Discret. Math. 347(3): 113801 (2024) - [j34]Vera Roshchina, Nadezda Sukhorukova
Uniqueness of solutions in multivariate Chebyshev approximation problems. Optim. Lett. 18(1): 33-55 (2024) - 2023
- [j33]Vincent Pilaud, Guillermo Pineda-Villavicencio, Julien Ugon
Edge connectivity of simplicial polytopes. Eur. J. Comb. 113: 103752 (2023) - [j32]R. Díaz Millán
Approximate Douglas-Rachford algorithm for two-sets convex feasibility problems. J. Glob. Optim. 86(3): 621-636 (2023) - [i7]Vinesha Peiris
A comparison of rational and neural network based approximations. CoRR abs/2303.04436 (2023) - [i6]R. Díaz Millán, Orizon P. Ferreira, Julien Ugon:
Frank-Wolfe algorithm for DC optimization problem. CoRR abs/2308.16444 (2023) - 2022
- [j31]Nadezda Sukhorukova
A generalisation of de la Vallée-Poussin procedure to multivariate approximations. Adv. Comput. Math. 48(1): 5 (2022) - [j30]Leif K. Jørgensen, Guillermo Pineda-Villavicencio, Julien Ugon
Linkedness of Cartesian products of complete graphs. Ars Math. Contemp. 22(2): 2 (2022) - [j29]Guillermo Pineda-Villavicencio, Julien Ugon
Minimum Number of Edges of Polytopes with $2d+2$ Vertices. Electron. J. Comb. 29(3) (2022) - [j28]Nicholas Parsons
Structural-functional connectivity bandwidth of the human brain. NeuroImage 263: 119659 (2022) - [i5]Su Yuan Chan, Kerri Morgan, Julien Ugon:
Finding Maximum Cliques in Large Networks. CoRR abs/2207.13010 (2022) - 2021
- [j27]Vinesha Peiris
Generalised rational approximation and its application to improve deep learning classifiers. Appl. Math. Comput. 389: 125560 (2021) - [j26]Hoa T. Bui
The Linkedness of Cubical Polytopes: The Cube. Electron. J. Comb. 28(3) (2021) - [j25]Su Yuan Chan
Supernodes: a generalization of the rich-club. J. Complex Networks 10(1) (2021) - [i4]Elior Kalfon, Vinesha Peiris, Nir Sharon, Nadia Sukhorukova, Julien Ugon:
Flexible rational approximation for matrix functions. CoRR abs/2108.09357 (2021) - [i3]Su Yuan Chan, Kerri Morgan, Nick Parsons, Julien Ugon:
Supernodes. CoRR abs/2108.10458 (2021) - 2020
- [j24]Guillermo Pineda-Villavicencio
Polytopes Close to Being Simple. Discret. Comput. Geom. 64(1): 200-215 (2020) - [j23]Hoa T. Bui
Connectivity of cubical polytopes. J. Comb. Theory A 169 (2020) - [i2]R. Díaz Millán, Nadezda Sukhorukova, Julien Ugon:
An algorithm for best generalised rational approximation of continuous functions. CoRR abs/2011.02721 (2020)
2010 – 2019
- 2019
- [j22]Joseph Doolittle, Eran Nevo, Guillermo Pineda-Villavicencio
On the Reconstruction of Polytopes. Discret. Comput. Geom. 61(2): 285-302 (2019) - [j21]Guillermo Pineda-Villavicencio
Lower bound theorems for general polytopes. Eur. J. Comb. 79: 27-45 (2019) - 2018
- [j20]Adil M. Bagirov
Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms. Optim. Methods Softw. 33(1): 194-219 (2018) - [j19]Guillermo Pineda-Villavicencio
The Excess Degree of a Polytope. SIAM J. Discret. Math. 32(3): 2011-2046 (2018) - 2017
- [j18]Jean-Pierre Crouzeix, Nadezda Sukhorukova
Characterization Theorem for Best Polynomial Spline Approximation with Free Knots, Variable Degree and Fixed Tails. J. Optim. Theory Appl. 172(3): 950-964 (2017) - [c4]Musa Mammadov
Detection of Outlier Behaviour Amongst Health/Medical Providers Servicing TAC Clients. AusDM 2017: 161-172 - [c3]Vishakha Sharma, Andrew Stranieri
An Agile Group Aware Process beyond CRISP-DM: A Hospital Data Mining Case Study. ICCDA 2017: 109-113 - 2016
- [j17]Nadezda Sukhorukova
Chebyshev Approximation by Linear Combinations of Fixed Knot Polynomial Splines with Weighting Functions. J. Optim. Theory Appl. 171(2): 536-549 (2016) - [j16]Adil M. Bagirov
Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems. Pattern Recognit. 53: 12-24 (2016) - 2015
- [j15]Zhiyou Wu, Jing Tian, Julien Ugon
Global optimality conditions and optimization methods for constrained polynomial programming problems. Appl. Math. Comput. 262: 312-325 (2015) - [j14]Zhi-You Wu, J. Tian, Julien Ugon
Global optimality conditions and optimization methods for polynomial programming problems. J. Glob. Optim. 62(4): 617-641 (2015) - [j13]Adil M. Bagirov
Nonsmooth Optimization Algorithm for Solving Clusterwise Linear Regression Problems. J. Optim. Theory Appl. 164(3): 755-780 (2015) - [j12]Jin Wang, Chee Peng Lim, Douglas C. Creighton, Abbas Khosravi, Saeid Nahavandi, Julien Ugon
Patient admission prediction using a pruned fuzzy min-max neural network with rule extraction. Neural Comput. Appl. 26(2): 277-289 (2015) - [j11]Adil M. Bagirov
An algorithm for clusterwise linear regression based on smoothing techniques. Optim. Lett. 9(2): 375-390 (2015) - 2014
- [j10]Zhiyou Wu, Jing Tian, Jing Quan, Julien Ugon
Optimality conditions and optimization methods for quartic polynomial optimization. Appl. Math. Comput. 232: 968-982 (2014) - 2013
- [j9]Adil M. Bagirov
Nonsmooth nonconvex optimization approach to clusterwise linear regression problems. Eur. J. Oper. Res. 229(1): 132-142 (2013) - 2012
- [j8]Ting Yu, Julien Ugon
A modified parallel optimization system for updating large-size time-evolving flow matrix. Inf. Sci. 194: 57-67 (2012) - [i1]Prabhu Manyem, Julien Ugon:
Computational Complexity, NP Completeness and Optimization Duality: A Survey. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j7]Adil M. Bagirov
An efficient algorithm for the incremental construction of a piecewise linear classifier. Inf. Syst. 36(4): 782-790 (2011) - [j6]Adil M. Bagirov
Codifferential method for minimizing nonsmooth DC functions. J. Glob. Optim. 50(1): 3-22 (2011) - [j5]Adil M. Bagirov
Classification through incremental max-min separability. Pattern Anal. Appl. 14(2): 165-174 (2011) - [j4]Adil M. Bagirov
Fast modified global k-means algorithm for incremental cluster construction. Pattern Recognit. 44(4): 866-876 (2011)
2000 – 2009
- 2009
- [j3]Nadezda Sukhorukova
Workload coverage through nonsmooth optimization. Optim. Methods Softw. 24(2): 285-298 (2009) - 2006
- [j2]Alex M. Rubinov, N. V. Soukhorokova, Julien Ugon
Classes and clusters in data analysis. Eur. J. Oper. Res. 173(3): 849-865 (2006) - [j1]Adil M. Bagirov
Piecewise Partially Separable Functions and a Derivative-free Algorithm for Large Scale Nonsmooth Optimization. J. Glob. Optim. 35(2): 163-195 (2006) - [c2]Shahnaz Kouhbor, Julien Ugon, Alex M. Rubinov, Alex Kruger, Musa A. Mammadov:
Coverage in WLAN with Minimum Number of Access Points. VTC Spring 2006: 1166-1170 - 2005
- [c1]Shahnaz Kouhbor, Julien Ugon
Optimal Placement of Access Point in WLAN Based on a New Algorithm. ICMB 2005: 592-598
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: