Imagen de Portada

The natural ordering cone of a polyhedral convex set-valued objective mapping

Fuente: arXiv

Guardado en:

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

Ejemplares similares

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

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

Convex sets approximable as the sum of a compact set and a cone
por: Dörfler, Daniel, et al.
Publicado: (2024)

On the approximation error for approximating convex bodies using multiobjective optimization
por: Löhne, Andreas, et al.
Publicado: (2021)

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

Approximate Vertex Enumeration
por: Löhne, Andreas
Publicado: (2020)

The Güntürk-Thao theorem revisited: polyhedral cones and limiting examples
por: Bauschke, Heinz H., et al.
Publicado: (2026)

Inner approximations of convex sets and intersections of projectionally exposed cones
por: Lourenço, Bruno F., et al.
Publicado: (2025)

Lagrange Duality in Set Optimization
por: Hamel, Andreas H., et al.
Publicado: (2012)

A vector linear programming approach for certain global optimization problems
por: Ciripoi, Daniel, et al.
Publicado: (2017)

Computing all Nash equilibria of low-rank bi-matrix games
por: Feinstein, Zachary, et al.
Publicado: (2025)

Convexification of classes of mixed-integer sets with L$^\natural$-convexity
por: Yu, Qimeng, et al.
Publicado: (2025)

Duality between polyhedral approximation of value functions and optimal quantization of measures
por: Mehamdi, Abdellah Bulaich, et al.
Publicado: (2025)

A global approach for generalized semi-infinte programs with polyhedral parameter sets
por: Hu, Xiaomeng, et al.
Publicado: (2025)

Extended formulations for the integer hull of strictly $Δ$-modular cographic polyhedral cones
por: Paat, Joseph, et al.
Publicado: (2023)

Solution uniqueness of convex optimization problems via the radial cone
por: Fadili, Jalal, et al.
Publicado: (2024)

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

Optimal $L^p$-approximation of convex sets by convex subsets
por: Fattah, Zakaria, et al.
Publicado: (2025)

Facial structure of copositive and completely positive cones over a second-order cone
por: Nishijima, Mitsuhiro, et al.
Publicado: (2025)

Polyhedral approximation of spectrahedral shadows via homogenization
por: Dörfler, Daniel, et al.
Publicado: (2023)

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

Subdifferentials of convex matrix-valued functions
por: Dolgopolik, M. V.
Publicado: (2023)

Unboundedness of the images of set-valued mappings having closed graphs: Application to vector optimization
por: Hieu, Vu Trung, et al.
Publicado: (2023)

Normal cones to sublevel sets of convex and quasi-convex supremum functions
por: Caro, Stephanie, et al.
Publicado: (2026)

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

Study of the behaviour of Nesterov Accelerated Gradient in a non convex setting: the strongly quasar convex case
por: Hermant, Julien, et al.
Publicado: (2024)

Some properties of sets, functions, and multi-objective optimization problems using p-convexity
por: Vera, Cristian
Publicado: (2026)

Nonsmooth Newton methods with effective subspaces for polyhedral regularization
por: Nghia, Tran T. A., et al.
Publicado: (2025)

Normalizations of factorizations over convex cones and their effects on extension complexity
por: Brown, Adam, et al.
Publicado: (2025)

Extremality of families of sets and set-valued optimization
por: Cuong, Nguyen Duy, et al.
Publicado: (2024)

Finite Representation of Quantile Sets for Multivariate Data via Vector Linear Programming
por: Löhne, Andreas, et al.
Publicado: (2023)

Linear and Second-order-cone Valid Inequalities for Problems with Storage
por: Morales, Juan M.
Publicado: (2025)

Exploiting higher-order derivatives in convex optimization methods
por: Kamzolov, Dmitry, et al.
Publicado: (2022)

A second-order cone representable class of nonconvex quadratic programs
por: Dey, Santanu S., et al.
Publicado: (2025)

Exploiting the polyhedral geometry of stochastic linear bilevel programming
por: Muñoz, Gonzalo, et al.
Publicado: (2022)

Computing cone-constrained singular values of matrices
por: Barbarino, Giovanni, et al.
Publicado: (2025)

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

Higher-order tensor methods for minimizing difference of convex functions
por: Necoara, Ion
Publicado: (2024)

A note on diffusive solutions of the Lyapunov and Riccati inequalities for quasi-monotone (QM) mappings on cones
por: Mason, Oliver
Publicado: (2026)

Sparsification of sums with respect to convex cones
por: Saunderson, James
Publicado: (2025)