Skip to main content

Resultados relacionados

Resultados totales (Incluyendo duplicados): 3
Encontrada(s) 1 página(s)

RUA. Repositorio Institucional de la Universidad de Alicante
Publication Otros (Other)

Randomized block proximal method with locally Lipschitz continuous gradient

  • Pérez-Aros, Pedro
  • Torregrosa-Belén, David
  • Torregrosa-Belén, David|||/items/31e6adbe-df7e-4c0e-b199-2a1098f83ec0
Block-coordinate algorithms are recognized to furnish efficient iterative schemes for addressing large-scale problems, especially when the computation of full derivatives entails substantial memory requirements and computational efforts. In this paper, we propose a randomized block proximal gradient algorithm for minimizing the sum of a smooth function and a separable proper lower semicontinuous function, both possibly nonconvex. In contrast to previous work, we only assume that the partial gradients of the smooth function are locally Lipschitz continuous with respect to their block of coordinates. At each iteration, the method adaptively selects a proximal stepsize to satisfy a sufficient decrease condition without requiring knowledge of the local Lipschitz moduli of the partial gradients of the smooth function. Hence, our work extends the applicability of randomized block-coordinate descent methods to more general problems where global Lipschitz gradient assumptions are not satisfied. In addition, our algorithm incorporates the possibility of conducting an additional boosted linesearch to enhance the performance of the algorithm. Our main result establishes subsequential convergence to a stationary point of the problem almost surely. Numerical experiments in nonnegative matrix factorization report that our method competes well with recognized algorithms. Furthermore, a symmetric variant of nonnegative matrix factorization illustrates the advantage of the boosted linesearch in problems where the proximal stepsize cannot be tightly estimated in accordance to the local Lipschitz modulus.
RUA. Repositorio Institucional de la Universidad de Alicante
Publication Otros (Other)

Normal cones to sublevel sets of suprema of convex and quasiconvex functions

  • Caro, Stephanie
  • Correa, Rafael
  • Hantoute, Abderrahim
  • Hantoute, Abderrahim|||/items/257fa651-9a93-4e26-b88e-d90594995ecc
We provide sharp and explicit characterizations of the normal cone to sublevel sets of suprema of arbitrary functions, expressed exclusively in terms of subdifferentials of the data functions. In the convex case, the resulting formulas involve the approximate and exact subdifferentials of the individual data functions at the nominal and nearby points. In contrast, the quasiconvex framework requires the use of the Fréchet subdifferential of these data functions but evaluated at nearby points. These results are applied to derive optimality conditions for infinite convex and quasiconvex optimization problems.
RUA. Repositorio Institucional de la Universidad de Alicante
Publication Otros (Other)

Nonmonotone subgradient methods based on a local descent lemma

  • Aragón Artacho, Francisco Javier
  • Campoy, Rubén
  • Pérez-Aros, Pedro
  • Torregrosa-Belén, David
  • Aragón Artacho, Francisco Javier|||/items/1606bcd1-4dcb-4543-98d2-cba4400516f6
  • Campoy, Rubén|||/items/21264c6a-ecd6-4c42-bdfb-61ec73f47d5c
  • Torregrosa-Belén, David|||/items/31e6adbe-df7e-4c0e-b199-2a1098f83ec0
In this paper we present a nonmonotone line search subgradient algorithm tailored to upper-C2 functions. This is a family of nonsmooth and nonconvex functions that satisfies a nonsmooth and local version of the descent lemma, making them suitable for line searches. We prove subsequential convergence of the proposed algorithm to a stationary point of the optimization problem. Our approach allows us to cover the setting of various subgradient algorithms, including Newton and quasi-Newton methods. In addition, we propose a specification of the general scheme, named Self-adaptive nonmonotone subgradient method (SNSM), which automatically updates the parameters of the line search. Particular attention is paid to the minimum sum-of-squares clustering problem, for whichwe provide a concrete implementation of SNSM. We conclude with some numerical experiments where we exhibit the advantages of SNSM in comparison with some known algorithms.