Cover Image

A Nonmonotone Front Descent Method for Bound-Constrained Multi-Objective Optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Mansueto, Pierluigi
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control 90C29, 90C30
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

A Bi-Objective Optimization Based Acquisition Strategy for Batch Bayesian Global Optimization
by: Carciaghi, Francesco, et al.
Published: (2024)

A heavy-ball type curve search method for smooth convexly constrained optimization
by: Donnini, Federica, et al.
Published: (2026)

A Subspace Minimization Barzilai-Borwein Method for Multiobjective Optimization Problems
by: Chen, Jian, et al.
Published: (2024)

First-order Methods for Unconstrained Vector Optimization Problems: A Unified Majorization-Minimization Perspective
by: Chen, Jian, et al.
Published: (2024)

Scaled Proximal Gradient Methods for Multiobjective Optimization: Improved Linear Convergence and Nesterov's Acceleration
by: Chen, Jian, et al.
Published: (2024)

Combining Gradient Information and Primitive Directions for High-Performance Mixed-Integer Optimization
by: Lapucci, Matteo, et al.
Published: (2024)

Projection-based curve pattern search for black-box optimization over smooth convex sets
by: Jia, Xiaoxi, et al.
Published: (2025)

Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm
by: De Santis, Marianna, et al.
Published: (2026)

Generalized Reduced Jacobian Method
by: Maghri, M. El, et al.
Published: (2025)

Memetic Differential Evolution Methods for Semi-Supervised Clustering
by: Mansueto, Pierluigi, et al.
Published: (2024)

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

Efficient globalization of heavy-ball type methods for unconstrained optimization based on curve searches
by: Donnini, Federica, et al.
Published: (2025)

Low-Rank Multi-Objective Linear Programming
by: Löhne, Andreas, et al.
Published: (2025)

Bi-Objective Optimization over the Efficient Set of Multi-Objective Integer Quadratic Problem
by: Bencheikh, Ali, et al.
Published: (2024)

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

An accelerated primal-dual flow for linearly constrained multiobjective optimization
by: Luo, Hao, et al.
Published: (2025)

On the Computation of the Efficient Frontier in Advanced Sparse Portfolio Optimization
by: Annunziata, Arturo, et al.
Published: (2025)

Optimal Subgradient Methods for Lipschitz Convex Optimization with Error Bounds
by: Wang, Alex L.
Published: (2025)

A Benson-Type Algorithm for Bounded Convex Vector Optimization Problems with Vertex Selection
by: Dörfler, Daniel, et al.
Published: (2020)

A KL-based Analysis Framework with Applications to Non-Descent Optimization Methods
by: Qiu, Junwen, et al.
Published: (2024)

Warm-starting outer approximation for parametrized convex MINLP
by: Tamm, Erik, et al.
Published: (2025)

A New Linear Programming Approach and a New Backtracking Strategy for Multiple-Gradient Descent in Multi-Objective Optimization
by: Della Santa, Francesco
Published: (2024)

On Computing and Pricing of Adjustable Robust Chemical Process Designs
by: Schwientek, Jan, et al.
Published: (2025)

Projected Gradient Methods with Momentum
by: Lapucci, Matteo, et al.
Published: (2026)

Level Constrained First Order Methods for Function Constrained Optimization
by: Boob, Digvijay, et al.
Published: (2022)

On the Relationship Between the Value Function and the Efficient Frontier of a Mixed Integer Linear Optimization Problem
by: Fallah, Samira, et al.
Published: (2023)

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

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

Sublinear Scalarizations for Proper and Approximate Proper Efficient Points in Nonconvex Vector Optimization
by: García-Castaño, Fernando, et al.
Published: (2024)

The Magnitude of Dominated Sets: A Pareto Compliant Indicator Grounded in Metric Geometry
by: Emmerich, Michael T. M.
Published: (2026)

A Sequential Quadratic Programming Method for Optimization with Stochastic Objective Functions, Deterministic Inequality Constraints and Robust Subproblems
by: Qiu, Songqiang, et al.
Published: (2023)

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

On the Convergence of Interior-Point Methods for Bound-Constrained Nonlinear Optimization Problems with Noise
by: Dezfulian, Shima, et al.
Published: (2024)

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

Tight Error Bounds for the Sign-Constrained Stiefel Manifold
by: Chen, Xiaojun, et al.
Published: (2022)

Second-Order Optimality Conditions for Sparse Differentiable Optimization Problems via Limiting Second-Order Subdifferentials
by: Huyen, Luu Thi Thu, et al.
Published: (2026)

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

A Globally Convergent Gradient Method with Momentum
by: Lapucci, Matteo, et al.
Published: (2024)