Cover Image

Characterization of Highly Robust Solutions in Multi-Objective Programming in Banach Spaces

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Rahimi, Morteza, Soleimani-damaneh, Majid
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control 90C29, 90C17, 90C46
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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)

Non-Attainment of Minima in Non-Polyhedral Conic Optimization: A Robust SOCP Example
by: Nguyen, Vinh
Published: (2025)

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

Multiobjective Programming and Weighting Scalar Problem
by: Ivanov, Vsevolod I.
Published: (2025)

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

Symmetric and Non-Symmetric Cone Separation via Bishop-Phelps Cones in Normed Spaces
by: García-Castaño, Fernando, et al.
Published: (2025)

Second-Order Strong Optimality and Second-Order Duality for Nonsmooth Constrained Multiobjective Fractional Programming Problems
by: Chen, Jiawei, et al.
Published: (2024)

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

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

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

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

Process-Based Lagrange Multipliers for Nonconvex Set-Valued Optimization
by: García-Castaño, Fernando, et al.
Published: (2026)

Aubin Property and Strong Regularity Are Equivalent for Nonlinear Second-Order Cone Programming
by: Chen, Liang, et al.
Published: (2024)

Characterizations of the Aubin Property of the Solution Mapping for Nonlinear Semidefinite Programming
by: Chen, Liang, et al.
Published: (2024)

Exact Solution Procedure for the Log-Linear Continuous Knapsack Problem
by: Lahiri, Somdeb
Published: (2024)

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

Adjustable Robust Nonlinear Network Design Without Controllable Elements under Load Scenario Uncertainties
by: Thürauf, Johannes, et al.
Published: (2024)

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

Second-Order Necessary Conditions, Constraint Qualifications and Exact Penalty for Mathematical Programs with Switching Constraints
by: Chen, Jiawei, et al.
Published: (2024)

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

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

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

Relaxations of KKT Conditions do not Strengthen Finite RLT and SDP-RLT Bounds for Nonconvex Quadratic Programs
by: Yildirim, E. Alper
Published: (2025)

Algebraic Farkas Lemma and Strong Duality for Perturbed Conic Linear Programming
by: Khanh, P. D., et al.
Published: (2026)

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

A Moment-SOS Hierarchy for Robust Polynomial Matrix Inequality Optimization with SOS-Convexity
by: Guo, Feng, et al.
Published: (2023)

Nonlinear Separation Theorems for Co-Radiant Sets and Optimality Conditions for Approximate and Proper Approximate Solutions in Vector Optimization
by: García-Castaño, Fernando, et al.
Published: (2025)

Generalized Reduced Jacobian Method
by: Maghri, M. El, 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)

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

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)

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)

A Gauge Set Framework for Flexible Robustness Design
by: Wei, Ningji, et al.
Published: (2025)

On Solution Uniqueness and Robust Recovery for Sparse Regularization with a Gauge: from Dual Point of View
by: He, Jiahuan, et al.
Published: (2023)