Seminar 2025-1
Organized by Leandro Prudente
------------------------------------------------------------------------------------------------------------------------------------------
The seminars will be held in the Lecture Room of IME/UFG. All interested are very welcome to attend.
------------------------------------------------------------------------------------------------------------------------------------------
Date: March 20
Speaker: Layane Rodrigues de Souza Queiroz
Title: Duas heurísticas para o problema da mochila bidimensional
Abstract: Neste trabalho duas heurísticas são propostas para o problema da mochila bidimensional. A primeira é uma heurística baseada no algoritmo genético de chaves aleatórias viciadas, enquanto a segunda implementa uma busca em vizinhança variável. As heurísticas consideram formas diferentes de conduzir o processo de otimização, a primeira sobre múltiplas trajetórias (isto é, uma população de indivíduos) e a segunda considerando uma trajetória única. Propõe-se na implementação da primeira heurística que a probabilidade viciada de herdar informações dos melhores indivíduos faz parte do próprio indivíduo, ao invés de ser um parâmetro constante durante a otimização. Adota-se para as heurísticas que uma solução do problema é codificada por um vetor de inteiros. Ao invés do vetor conter apenas os números que identificam os itens, propõe-se incluir outros números para auxiliar durante o posicionamento dos itens. Dessa forma, não necessariamente um item vai ser posicionado na primeira posição válida do recipiente, ajudando a escapar de possíveis ótimos locais. O posicionamento de itens no recipiente segue a sequência obtida do vetor que representa a solução, adotando-se três regras, uma que é a bottom-left e outras duas propostas com base nela. As duas heurísticas são comparadas com a heurística geral de Mundim et al. (2018), até então estado-da-arte para o problema da mochila, conseguindo obter resultados iguais ou melhores para todas as instâncias. A primeira heurística é capaz de obter soluções cuja ocupação do recipiente é quase 7% maior, na média, enquanto a segunda heurística traz uma melhora na ocupação do recipiente de quase 6%, na média, comparado com Mundim et al. (2018). Para uma instância é possível melhorar a ocupação em quase 18%.
------------------------------------------------------------------------------------------------------------------------------------------
Date: March 27
Speaker: Max Leandro Nobre Gonçalves
Title: A fully subsampled cubic regularization method for finite-sum minimization
Abstract: In this talk, we propose and analyse a fully subsampled Cubic Regularization Method (F-CRM) for solving finite-sum optimization problems. The proposed method uses a general random subsampling techniques to approximate the functions, gradients and Hessians in order to reduce the overall computational cost of the CRM. Under suitable hypotheses, first- and second-order iteration-complexity bounds and global convergence analyses are presented.
------------------------------------------------------------------------------------------------------------------------------------------
Date: April 3
Speaker: Tiago Sousa Mota
Title: Proximal Alternating Minimization for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
Abstract: In this talk, we will present the convergence properties of an alternating proximal minimization algorithm for non-convex structured functions of the type: L(x, y) = f (x) + Q(x, y) + g(y) , where f and g are proper lower semicontinuous functions defined on Euclidean spaces and Q is a smooth function coupling the variables x and y. The results are in a non-convex setting, assuming only that the function L satisfies the Kurdyka-Łojasiewicz inequality. The main result can be stated as follows: If L has the Kurdyka-Łojasiewicz property, then every bounded sequence generated by the algorithm converges to a critical point of L. This result is completed by the study of the convergence rate of the algorithm, which depends on the geometric properties of the function L around its critical points.
------------------------------------------------------------------------------------------------------------------------------------------
Date: April 10
Speaker: Kelvin Rodrigues Couto
Title: Global convergence of an augmented Lagrangian method from a Riemannian perspective
Abstract: Considering a standard nonlinear programming problem, it is possible to interpret a subset of equality constraints as an embedded Riemannian manifold. This presentation examines the distinctions between the Euclidean and Riemannian approaches to this class of problems. It is well-established that the linear independence constraint qualification is equivalent under both methodologies. However, when examining the recently proposed constant rank constraint qualifications, the Riemannian framework yields a weaker condition, as it requires that the gradients' rank remains constant only within the manifold itself. Conversely, the Euclidean method mandates constant rank properties throughout a full-dimensional neighborhood of the ambient space. Consequently, by applying a Riemannian augmented Lagrangian method to a standard nonlinear programming problem, standard global convergence to a Karush/Kuhn-Tucker point is achieved under a newly introduced weaker constant rank condition that considers only lower-dimensional neighborhoods. Thus, the Riemannian viewpoint demonstrates the potential to generate novel and stronger outcomes for classical optimization problems traditionally solved through Euclidean methods. Additionally, two distinct augmented Lagrangian algorithms are evaluated via an extensive computational analysis, revealing several classes of problems for which the Riemannian approach significantly outperforms the Euclidean method, producing solutions of superior quality.
------------------------------------------------------------------------------------------------------------------------------------------
Date: April 17
Speaker: Claudemir Rodrigues Santiago
Title: Convergence of Inexact Proximal Gradient Methods for Composite Optimization Problems
Abstract: In this talk, we present results based on the work by Huang et al., Inexact Proximal Gradient Methods for Non-Convex and Non-Smooth Optimization, Proceedings of the AAAI Conference on Artificial Intelligence, 32(1), 2018. We will discuss recent advances in the development and
theoretical analysis of inexact proximal gradient methods applied to composite optimization problems, both convex and non-convex. These methods are widely used in settings involving non-smooth regularization, particularly in machine learning. We introduce three variants of inexact proximal gradient algorithms (including a basic version and an accelerated version inspired by Nesterov) and present convergence analysis of the accelerated algorithm for the convex case.
------------------------------------------------------------------------------------------------------------------------------------------
Date: April 24
Speaker: Leandro da Fonseca Prudente
Title: A Proximal Gradient method with an explicit line search for multiobjective optimization
Abstract: We present a proximal gradient method for solving convex multiobjective optimization problems, where each objective function is the sum of two convex functions, with one assumed to be continuously differentiable. The algorithm incorporates a backtracking line search procedure that requires solving only one proximal subproblem per iteration, and is exclusively applied to the differentiable part of the objective functions. Under mild assumptions, we show that the sequence generated by the method convergences to a weakly Pareto optimal point of the problem. Additionally, we establish an iteration complexity bound by showing that the method finds an ε-approximate weakly Pareto point in at most O(1/ε) iterations.
------------------------------------------------------------------------------------------------------------------------------------------
Date: May 15
Speaker: Mauricio Silva Louzeiro
Title:
Abstract:
------------------------------------------------------------------------------------------------------------------------------------------
Date: May 22
Speaker: Glaydston de Carvalho Bento
Title:
Abstract:
------------------------------------------------------------------------------------------------------------------------------------------
Date: May 29
Speaker: Jefferson D. Gonçalves de Melo
Title:
Abstract:
------------------------------------------------------------------------------------------------------------------------------------------
Date: June 5
Speaker: Claudemir Rodrigues Santiago
Title:
Abstract:
------------------------------------------------------------------------------------------------------------------------------------------
Date: June 12
Speaker: Alejandra Muñoz González
Title:
Abstract:
------------------------------------------------------------------------------------------------------------------------------------------
Date: June 26
Speaker: Jose Roberto Ribeiro Junior
Title:
Abstract:
------------------------------------------------------------------------------------------------------------------------------------------
Date: July 3
Speaker: Tiago Sousa Mota
Title:
Abstract: