Image de couverture de livre

Some optimality conditions of set-valued optimization problems in locally convex topological vector spaces

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Zeng, Renying
Format:	Preprint
Publié:	2024
Sujets:	Optimization and Control 90C26, 90C29, 90C48
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Existence of solutions for polyhedral convex set optimization problems
par: Löhne, Andreas
Publié: (2023)

A solution method for arbitrary polyhedral convex set optimization problems
par: Löhne, Andreas
Publié: (2023)

${\varepsilon}$-optimality in reverse convex optimization
par: Maghri, M. El, et autres
Publié: (2025)

Projection-based curve pattern search for black-box optimization over smooth convex sets
par: Jia, Xiaoxi, et autres
Publié: (2025)

Lagrange Multipliers, Duality, and Sensitivity in Set-Valued Convex Programming via Pointed Closed Convex Processes
par: García-Castaño, Fernando, et autres
Publié: (2024)

A Set-Valued Lagrange Theorem based on a Process for Convex Vector Programming
par: García-Castaño, Fernando, et autres
Publié: (2024)

A Riemannian Accelerated Proximal Gradient Method
par: Feng, Shuailing, et autres
Publié: (2025)

On the existence and the stability of solutions in nonconvex vector optimization
par: Van Nghi, Tran, et autres
Publié: (2025)

Effective Front-Descent Algorithms with Convergence Guarantees
par: Lapucci, Matteo, et autres
Publié: (2024)

Cardinality-Constrained Multi-Objective Optimization: Novel Optimality Conditions and Algorithms
par: Lapucci, Matteo, et autres
Publié: (2023)

Projected Gradient Methods with Momentum
par: Lapucci, Matteo, et autres
Publié: (2026)

Process-Based Lagrange Multipliers for Nonconvex Set-Valued Optimization
par: García-Castaño, Fernando, et autres
Publié: (2026)

A three-term Polak-Ribière-Polyak conjugate gradient method for vector optimization
par: Lin, Guangxuan, et autres
Publié: (2025)

On the convexity for the range set of two quadratic functions
par: Nguyen, Huu-Quang, et autres
Publié: (2025)

First and Second Order Necessary and Sufficient Optimality Conditions of Fritz John Type for Vector Problems over Cones
par: Ivanov, Vsevolod I.
Publié: (2024)

Multiobjective Programming and Weighting Scalar Problem
par: Ivanov, Vsevolod I.
Publié: (2025)

Linear programming for finite-horizon vector-valued Markov decision processes
par: Mifrani, Anas, et autres
Publié: (2025)

Sparse convex relaxations in polynomial optimization
par: Averkov, Gennadiy, et autres
Publié: (2024)

A globalization of L-BFGS and the Barzilai-Borwein method for nonconvex unconstrained optimization
par: Mannel, Florian
Publié: (2024)

Stochastic block coordinate and function alternation for multi-objective optimization and learning
par: Tran, Trang H., et autres
Publié: (2026)

Real-time solution of quadratic optimization problems with banded matrices and indicator variables
par: Gomez, Andres, et autres
Publié: (2024)

Symmetric and Non-Symmetric Cone Separation via Bishop-Phelps Cones in Normed Spaces
par: García-Castaño, Fernando, et autres
Publié: (2025)

New merit functions for multiobjective optimization and their properties
par: Tanabe, Hiroki, et autres
Publié: (2020)

Worst-case complexity analysis of derivative-free methods for multi-objective optimization
par: Liuzzi, Giampaolo, et autres
Publié: (2025)

On convergence of a $q$-random coordinate constrained algorithm for non-convex problems
par: Ghaffari-Hadigheh, Alireza, et autres
Publié: (2022)

Approximate optimality conditions and sensitivity analysis in nearly convex optimization
par: Van Tuyen, Nguyen, et autres
Publié: (2024)

Biobjective optimization with M-convex functions
par: Fukuda, Ellen H., et autres
Publié: (2025)

Depth-first directional search for nonconvex optimization
par: Zhang, Yuxuan, et autres
Publié: (2024)

Penalty decomposition derivative free method for the minimization of partially separable functions over a convex feasible set
par: Cecere, Francesco, et autres
Publié: (2025)

A new envelope function for nonsmooth DC optimization
par: Themelis, Andreas, et autres
Publié: (2020)

Sum-of-squares hierarchies for polynomial optimization and the Christoffel-Darboux kernel
par: Slot, Lucas
Publié: (2021)

On a minimization problem of the maximum generalized eigenvalue: properties and algorithms
par: Nishioka, Akatsuki, et autres
Publié: (2023)

T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization
par: Marumo, Hiroki, et autres
Publié: (2024)

Decentralized projected Riemannian stochastic recursive momentum method for nonconvex optimization
par: Deng, Kangkang, et autres
Publié: (2024)

A Frank-Wolfe-based primal heuristic for quadratic mixed-integer optimization
par: Mexi, Gioni, et autres
Publié: (2025)

A study of column generation embedded in scalarization methods for the bi-objective cutting stock problem
par: Borges, Jennifer C., et autres
Publié: (2026)

Nonconvergence of a sum-of-squares hierarchy for global polynomial optimization based on push-forward measures
par: Slot, Lucas, et autres
Publié: (2024)

A sensitivity-based method for bilevel optimization problems: Theoretical analysis and computational performance
par: Nolasco, Eduardo, et autres
Publié: (2025)

A four-operator splitting algorithm for nonconvex and nonsmooth optimization
par: Alcantara, Jan Harold, et autres
Publié: (2024)

Bundle methods with quadratic cuts for deterministic and stochastic strongly convex optimization problems
par: Guigues, Vincent, et autres
Publié: (2017)