Skip to main content
Journal of Computational and Applied MathematicsVolume 423, 15 May 2023, Article number 114943

An inexact restoration-nonsmooth algorithm with variable accuracy for stochastic nonsmooth convex optimization problems in machine learning and stochastic linear complementarity problems(Article)(Open Access)

  Save all to author list
  • aDepartment of Mathematics and Informatics, Faculty of Sciences, University of Novi Sad, Trg Dositeja Obradovića 4, Novi Sad, 21000, Serbia
  • bDepartment of Fundamental Sciences, Faculty of Technical Sciences, University of Novi Sad, Trg Dositeja Obradovića 6, Novi Sad, 21000, Serbia

Abstract

We study unconstrained optimization problems with nonsmooth and convex objective function in the form of a mathematical expectation. The proposed method approximates the expected objective function with a sample average function using Inexact Restoration-based adapted sample sizes. The sample size is chosen in an adaptive manner based on Inexact Restoration. The algorithm uses line search and assumes descent directions with respect to the current approximate function. We prove the a.s. convergence under standard assumptions. Numerical results for two types of problems, machine learning loss function for training classifiers and stochastic linear complementarity problems, prove the efficiency of the proposed scheme. © 2022 Elsevier B.V.

Author keywords

Inexact restorationNonsmooth optimizationSample average approximationSubgradientVariable sample size

Indexed keywords

Engineering controlled terms:Approximation algorithmsConvex optimizationRestorationSamplingStochastic systems
Engineering uncontrolled termsInexact restorationMachine-learningNonsmooth optimizationObjective functionsSample average approximationSample sizesStochastic linear complementarity problemStochasticsSubgradientVariable sample size
Engineering main heading:Machine learning

Funding details

Funding sponsor Funding number Acronym
Ministarstvo Prosvete, Nauke i Tehnološkog RazvojaMPNTR
Provincial Secretariat for Higher Education and Scientific Research, Autonomous Province of Vojvodina142-451-2593/2021-01/2
  • 1

    The work of Krejić and Krklec Jerinkić is supported by Provincial Secretariat for Higher Education and Scientific Research of Vojvodina , grant no. 142-451-2593/2021-01/2 . The work of Ostojić is supported by the Ministry of Education, Science and Technological Development, Republic of Serbia .

  • ISSN: 03770427
  • Source Type: Journal
  • Original language: English
  • DOI: 10.1016/j.cam.2022.114943
  • Document Type: Article
  • Publisher: Elsevier B.V.

  Ostojić, T.; Department of Fundamental Sciences, Faculty of Technical Sciences, University of Novi Sad, Trg Dositeja Obradovića 6, Novi Sad, Serbia;
© Copyright 2022 Elsevier B.V., All rights reserved.

Cited by 3 documents

Krklec Jerinkić, N. , Ostojić, T.
AN-SPS: adaptive sample size nonmonotone line search spectral projected subgradient method for convex constrained optimization problems
(2024) Optimization Methods and Software
Sun, S. , Diao, Q. , Xu, D.
Convex Quaternion Optimization for Signal Processing: Theory and Applications
(2023) IEEE Transactions on Signal Processing
Liao, J. , Wan, Z.
Inexact Restoration Methods for Semivectorial Bilevel Programming Problem on Riemannian Manifolds
(2022) Axioms
View details of all 3 citations
{"topic":{"name":"Nonsmooth Optimization; Objective Function; Approximation (Algorithm)","id":22601,"uri":"Topic/22601","prominencePercentile":63.4264,"prominencePercentileString":"63.426","overallScholarlyOutput":0},"dig":"fd772f80f89f634480a1ef56e6906e482c19d03d63750703a3182518430af47c"}

SciVal Topic Prominence

Topic:
Prominence percentile: