Nadezda Sukhorukova

Orcid: 0000-0002-4078-2014

According to our database1, Nadezda Sukhorukova authored at least 16 papers between 2008 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

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

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

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

2021
Flexible rational approximation for matrix functions.
CoRR, 2021

Deep Learning with Nonsmooth Objectives.
CoRR, 2021

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

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

2019
Two curve Chebyshev approximation and its application to signal clustering.
Appl. Math. Comput., 2019

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

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

Linear least squares problems involving fixed knots polynomial splines and their singularity study.
Appl. Math. Comput., 2016

2015
Convex optimisation-based methods for K-complex detection.
Appl. Math. Comput., 2015

2012
K-Complex Detection Using a Hybrid-Synergic Machine Learning Method.
IEEE Trans. Syst. Man Cybern. Part C, 2012

2010
Uniform Approximation by the Highest Defect Continuous Polynomial Splines: Necessary and Sufficient Optimality Conditions and Their Generalisations.
J. Optim. Theory Appl., 2010

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

2008
A generalization of the Remez algorithm to a class of linear spline approximation problems with constraints on spline parameters.
Optim. Methods Softw., 2008


  Loading...