Copertina

Stochastic block coordinate and function alternation for multi-objective optimization and learning

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Tran, Trang H., Vicente, Luis Nunes
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Optimization and Control 90C29, 90C06, 90C15
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

On Tackling High-Dimensional Nonconvex Stochastic Optimization via Stochastic First-Order Methods with Non-smooth Proximal Terms and Variance Reduction
di: Xie, Yue, et al.
Pubblicazione: (2025)

Worst-case complexity analysis of derivative-free methods for multi-objective optimization
di: Liuzzi, Giampaolo, et al.
Pubblicazione: (2025)

New merit functions for multiobjective optimization and their properties
di: Tanabe, Hiroki, et al.
Pubblicazione: (2020)

Stochastic Optimization under Hidden Convexity
di: Fatkhullin, Ilyas, et al.
Pubblicazione: (2023)

Lagrangian cuts generated by batch to efficiently solve two-stage stochastic mixed-integer program
di: Xiaoyu, Luo, et al.
Pubblicazione: (2024)

Stochastic First-Order Methods with Non-smooth and Non-Euclidean Proximal Terms for Nonconvex High-Dimensional Stochastic Optimization
di: Xie, Yue, et al.
Pubblicazione: (2024)

Shuffling the Stochastic Mirror Descent via Dual Lipschitz Continuity and Kernel Conditioning
di: Qiu, Junwen, et al.
Pubblicazione: (2026)

Stochastic Variance-Reduced Forward-Reflected-Backward Splitting Methods for Nonmonotone Generalized Equations
di: Tran-Dinh, Quoc
Pubblicazione: (2024)

A Note on Piecewise Affine Decision Rules for Robust, Stochastic, and Data-Driven Optimization
di: Thomä, Simon, et al.
Pubblicazione: (2024)

A new envelope function for nonsmooth DC optimization
di: Themelis, Andreas, et al.
Pubblicazione: (2020)

Scalarization via utility functions in multi-objective optimization
di: Lampariello, Lorenzo, et al.
Pubblicazione: (2024)

Bregman Stochastic Proximal Point Algorithm with Variance Reduction
di: Traoré, Cheik, et al.
Pubblicazione: (2025)

Some optimality conditions of set-valued optimization problems in locally convex topological vector spaces
di: Zeng, Renying
Pubblicazione: (2024)

A Single-Loop Stochastic Proximal Quasi-Newton Method for Large-Scale Nonsmooth Convex Optimization
di: Song, Yongcun, et al.
Pubblicazione: (2024)

On convergence of a $q$-random coordinate constrained algorithm for non-convex problems
di: Ghaffari-Hadigheh, Alireza, et al.
Pubblicazione: (2022)

New vector transport operators extending a Riemannian CG algorithm to generalized Stiefel manifold with low-rank applications
di: Wang, Xuejie, et al.
Pubblicazione: (2023)

Existence of solutions for polyhedral convex set optimization problems
di: Löhne, Andreas
Pubblicazione: (2023)

A study of column generation embedded in scalarization methods for the bi-objective cutting stock problem
di: Borges, Jennifer C., et al.
Pubblicazione: (2026)

An uncertainty model for positive-valued parameters with application to robust optimization
di: Tanaka, Tatsuya, et al.
Pubblicazione: (2026)

A solution method for arbitrary polyhedral convex set optimization problems
di: Löhne, Andreas
Pubblicazione: (2023)

Convergence analysis of a primal-dual optimization-by-continuation algorithm
di: Loris, Ignace, et al.
Pubblicazione: (2023)

Fully First-Order Methods for Decentralized Bilevel Optimization
di: Wang, Xiaoyu, et al.
Pubblicazione: (2024)

Two-stage heuristic algorithm for a new variant of the multi-compartment vehicle routing problem with stochastic demands
di: Gonçalves-Dosantos, Juan Carlos, et al.
Pubblicazione: (2024)

High Probability Guarantees for Random Reshuffling
di: Yu, Hengxu, et al.
Pubblicazione: (2023)

Bundle methods with quadratic cuts for deterministic and stochastic strongly convex optimization problems
di: Guigues, Vincent, et al.
Pubblicazione: (2017)

A three-term Polak-Ribière-Polyak conjugate gradient method for vector optimization
di: Lin, Guangxuan, et al.
Pubblicazione: (2025)

Nonsmooth exact penalty methods for equality-constrained optimization: complexity and implementation
di: Diouane, Youssef, et al.
Pubblicazione: (2024)

A Projection-Free Method for Solving Convex Bilevel Optimization Problems
di: Giang-Tran, Khanh-Hung, et al.
Pubblicazione: (2023)

Decentralized projected Riemannian stochastic recursive momentum method for nonconvex optimization
di: Deng, Kangkang, et al.
Pubblicazione: (2024)

Multiple objective linear programming over the probability simplex
di: Mifrani, Anas
Pubblicazione: (2024)

Biobjective optimization with M-convex functions
di: Fukuda, Ellen H., et al.
Pubblicazione: (2025)

Projected Gradient Methods with Momentum
di: Lapucci, Matteo, et al.
Pubblicazione: (2026)

Effective Front-Descent Algorithms with Convergence Guarantees
di: Lapucci, Matteo, et al.
Pubblicazione: (2024)

Generalized Reduced Jacobian Method
di: Maghri, M. El, et al.
Pubblicazione: (2025)

Cardinality-Constrained Multi-Objective Optimization: Novel Optimality Conditions and Algorithms
di: Lapucci, Matteo, et al.
Pubblicazione: (2023)

Characterization of Highly Robust Solutions in Multi-Objective Programming in Banach Spaces
di: Rahimi, Morteza, et al.
Pubblicazione: (2025)

Linear programming for finite-horizon vector-valued Markov decision processes
di: Mifrani, Anas, et al.
Pubblicazione: (2025)

Superadditivity-based valid inequalities and asymptotic bounds for the vehicle routing problem with stochastic demands
di: Legault, Robin, et al.
Pubblicazione: (2025)

Lagrange Multipliers, Duality, and Sensitivity in Set-Valued Convex Programming via Pointed Closed Convex Processes
di: García-Castaño, Fernando, et al.
Pubblicazione: (2024)

A Set-Valued Lagrange Theorem based on a Process for Convex Vector Programming
di: García-Castaño, Fernando, et al.
Pubblicazione: (2024)