Cover Image

Identification of Active Subfunctions in Finite-Max Minimisation via a Smooth Reformulation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ras, Charl, Tam, Matthew, Uteda, Daniel
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control 49K35, 65B99, 65K15, 65Y20, 90C25, 90C33, 90C47
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On circumcentered direct methods for monotone variational inequality problems
by: Behling, Roger, et al.
Published: (2025)

Nonsmooth Projection-Free Optimization with Functional Constraints
by: Asgari, Kamiar, et al.
Published: (2023)

Active set identification and rapid convergence for degenerate primal-dual problems
by: Díaz, Mateo, et al.
Published: (2026)

Time-integrated Optimal Transport: A Robust Minimax Framework
by: Nguyen, Thai P. D., et al.
Published: (2025)

An Adaptive Order Caputo Fractional Gradient Descent Method for Multi-objective Optimization Problems
by: Shaw, Barsha, et al.
Published: (2025)

A Symplectic Discretization Based Proximal Point Algorithm for Convex Minimization
by: Yuan, Ya-xiang, et al.
Published: (2024)

Optimality Conditions and Numerical Algorithms for a Class of Minimax Bilevel Optimization Problems
by: Hu, Yaling, et al.
Published: (2026)

A Unified Analysis on the Subgradient Upper Bounds for the Subgradient Methods Minimizing Composite Nonconvex, Nonsmooth and Non-Lipschitz Functions
by: Zhu, Daoli, et al.
Published: (2023)

A preconditioned difference of convex functions algorithm with extrapolation and line search
by: Zhang, Ran, et al.
Published: (2025)

Mathematical programs with complementarity constraints and application to hyperparameter tuning for nonlinear support vector machines
by: Ward, Samuel, et al.
Published: (2025)

Robust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applications
by: Saadati, Maryam, et al.
Published: (2022)

Symplectic Discretization Approach for Developing New Proximal Point Algorithm
by: Yuan, Ya-xiang, et al.
Published: (2023)

A Proximal-Gradient Method for Solving Regularized Optimization Problems with General Constraints
by: Curtis, Frank E., et al.
Published: (2025)

A Proximal-Gradient Method for Constrained Optimization
by: Dai, Yutong, et al.
Published: (2024)

Optimization in Theory and Practice
by: Wright, Stephen J.
Published: (2025)

On the Convergence Rates of Iterative Regularization Algorithms for Composite Bi-Level Optimization
by: Shtern, Shimrit, et al.
Published: (2025)

Symplectic Extra-gradient Type Method for Solving General Non-monotone Inclusion Problem
by: Yuan, Ya-xiang, et al.
Published: (2024)

Fast Optimistic Gradient Descent Ascent (OGDA) method in continuous and discrete time
by: Bot, Radu Ioan, et al.
Published: (2022)

Nonsmooth convex-concave saddle point problems with cardinality penalties
by: Bian, Wei, et al.
Published: (2024)

New Primal-Dual Algorithm for Convex Problems
by: Liu, Shuning, et al.
Published: (2025)

Fast Reflected Forward-Backward algorithm: achieving fast convergence rates for convex optimization with linear cone constraints
by: Bot, Radu Ioan, et al.
Published: (2024)

A finitely convergent circumcenter method for the Convex Feasibility Problem
by: Behling, Roger, et al.
Published: (2023)

Parallel Polyhedral Projection Method for the Convex Feasibility Problem
by: Barros, Pablo, et al.
Published: (2025)

Fejér* monotonicity in optimization algorithms
by: Behling, Roger, et al.
Published: (2024)

Strong Convergence of Relaxed Inertial Inexact Progressive Hedging Algorithm for Multi-stage Stochastic Variational Inequality Problems
by: Chen, Jiaxin, et al.
Published: (2024)

Monomial barrier functions for the box-constrained convex optimization problems
by: Fayed, Hatem
Published: (2024)

Relaxed Weak Accelerated Proximal Gradient Method: a Unified Framework for Nesterov's Accelerations
by: Li, Hongda, et al.
Published: (2025)

On the convergence of an inertial proximal algorithm with a Tikhonov regularization term
by: László, Szilárd Csaba
Published: (2023)

Deep Centralization for the Circumcentered Reflection Method
by: Barros, Pablo
Published: (2025)

MGProx: A nonsmooth multigrid proximal gradient method with adaptive restriction for strongly convex optimization
by: Ang, Andersen, et al.
Published: (2023)

New Classes of Non-monotone Variational Inequality Problems Solvable via Proximal Gradient on Smooth Gap Functions
by: Zhao, Lei, et al.
Published: (2025)

Performance Estimation for Smooth and Strongly Convex Sets
by: Luner, Alan, et al.
Published: (2024)

Adaptive Dimension Reduction for Overlapping Group Sparsity
by: Bai, Yifan, et al.
Published: (2026)

Parallel block coordinate descent methods with identification strategies
by: Lopes, Ronaldo, et al.
Published: (2025)

Splitting Algorithms for Distributionally Robust Optimization
by: Briceño-Arias, Luis, et al.
Published: (2024)

A Tunneling Method for Nonlinear Multi-objective Optimization Problems
by: Adhikary, Bikram, et al.
Published: (2024)

Global Descent Method for Non-convex Multi-objective Optimization Problems
by: Adhikary, Bikram, et al.
Published: (2025)

Extra-Gradient Method with Flexible Anchoring: Strong Convergence and Fast Residual Decay
by: Boţ, Radu Ioan, et al.
Published: (2024)

Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints
by: Berahas, Albert S., et al.
Published: (2025)

On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation
by: Bollapragada, Raghu, et al.
Published: (2025)