Cover Image

Approximations of unbounded convex projections and unbounded convex sets

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kováčová, Gabriela, Rudloff, Birgit
Format:	Preprint
Published:	2023
Subjects:	Optimization and Control 90C29
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

Nesterov's accelerated gradient for unbounded convex functions finds the minimum-norm point in the dual space
by: Sakabe, Keiya
Published: (2026)

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

${\varepsilon}$-optimality in reverse convex optimization
by: Maghri, M. El, et al.
Published: (2025)

Efficient points in a sum of sets of alternatives
by: Mifrani, Anas
Published: (2024)

Gradient descent for unbounded convex functions on Hadamard manifolds and its applications to scaling problems
by: Hirai, Hiroshi, et al.
Published: (2024)

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

One-parameter Filled Function Method for Non-convex Multi-objective Optimization Problems
by: Adhikary, Bikram, et al.
Published: (2026)

Linesearch-free adaptive Bregman proximal gradient for convex minimization without relative smoothness
by: Ou, Hongjia, et al.
Published: (2025)

On the convexity for the range set of two quadratic functions
by: Nguyen, Huu-Quang, et al.
Published: (2025)

A feasible smoothing accelerated projected gradient method for nonsmooth convex optimization
by: Nishioka, Akatsuki, et al.
Published: (2023)

A constraint-based approach to function interpolation, with application to performance estimation for weakly convex optimisation
by: Rubbens, Anne, et al.
Published: (2024)

A full splitting algorithm for structured difference-of-convex programs
by: Bot, Radu Ioan, et al.
Published: (2025)

A diving heuristic for mixed-integer problems with unbounded semi-continuous variables
by: Halbig, Katrin, et al.
Published: (2024)

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

Generator Sets for the Minkowski Sum Problem -- Theory and Insights
by: Lyngesen, Mark, et al.
Published: (2025)

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 Nonmonotone Front Descent Method for Bound-Constrained Multi-Objective Optimization
by: Mansueto, Pierluigi
Published: (2025)

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

Multiple objective linear programming over the probability simplex
by: Mifrani, Anas
Published: (2024)

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

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

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)

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

Approximating the set of Nash equilibria for convex games
by: Feinstein, Zachary, et al.
Published: (2023)

Set optimization - a rather short introduction
by: Hamel, Andreas H., et al.
Published: (2014)

A polynomial projective algorithm for convex feasibility problems with positive-definite constraints
by: Chubanov, Sergei
Published: (2025)

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

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

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

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

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

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

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

Stochastic block coordinate and function alternation for multi-objective optimization and learning
by: Tran, Trang H., et al.
Published: (2026)

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