Imagen de Portada

Existence of solutions for polyhedral convex set optimization problems

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Löhne, Andreas
Formato:	Preprint
Publicado:	2023
Materias:	Optimization and Control 90C99, 90C29, 90C05
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming
por: Löhne, Andreas, et al.
Publicado: (2015)

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

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

A Solution Concept for Convex Vector Optimization Problems based on a User-defined Region of Interest
por: Dörfler, Daniel, et al.
Publicado: (2026)

MOCVXPY: a CVXPY extension for multiobjective optimization
por: Salomon, Ludovic, et al.
Publicado: (2025)

A Decision-Making Method in Polyhedral Convex Set Optimization
por: Löhne, Andreas
Publicado: (2024)

The vector linear program solver Bensolve -- notes on theoretical background
por: Löhne, Andreas, et al.
Publicado: (2015)

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

Multiple objective linear programming over the probability simplex
por: Mifrani, Anas
Publicado: (2024)

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

Multi-objective stochastic linear programming with recourse and flexible decision making
por: Hamel, Andreas H., et al.
Publicado: (2024)

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

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

Approximations of unbounded convex projections and unbounded convex sets
por: Kováčová, Gabriela, et al.
Publicado: (2023)

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

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

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

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

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

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

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

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

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

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

On the Dual of the Solvency Cone
por: Löhne, Andreas, et al.
Publicado: (2014)

Benchmarking of quantum and classical SDP relaxations for QUBO formulations of real-world logistics problems
por: Ostermann, Birte, et al.
Publicado: (2025)

On the convergence of proximal gradient methods for convex simple bilevel optimization
por: Latafat, Puya, et al.
Publicado: (2023)

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

Necessary conditions for approximate solutions of vector and set optimization problems with variable domination structure
por: Durea, Marius, et al.
Publicado: (2025)

On approximate Pareto solutions in nonsmooth interval-valued multiobjective optimization with data uncertainty in constraints
por: Quan, Vu Hong, et al.
Publicado: (2025)

Solving bilevel optimization via sequential minimax optimization
por: Lu, Zhaosong, et al.
Publicado: (2025)

Damage Location in Mechanical Structures by Multi-Objective Pattern Search
por: Günther, Christian, et al.
Publicado: (2024)

Asymmetric Long-Step Primal-Dual Interior-Point Methods with Dual Centering
por: Nesterov, Yurii
Publicado: (2025)

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

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

Generalized Reduced Jacobian Method
por: Maghri, M. El, et al.
Publicado: (2025)

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

Projected Gradient Methods with Momentum
por: Lapucci, Matteo, et al.
Publicado: (2026)