Sharp minima for multiobjective optimization in Banach spaces
From MaRDI portal
Publication:858169
DOI10.1007/s11228-006-0023-7zbMath1103.49009OpenAlexW1982248867MaRDI QIDQ858169
X. Y. Zheng, Kok Lay Teo, Yang, Xinmin
Publication date: 8 January 2007
Published in: Set-Valued Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11228-006-0023-7
Related Items (12)
Sharp efficiency for vector equilibrium problems on Banach spaces ⋮ Structure and weak sharp minimum of the Pareto solution set for piecewise linear multiobjective optimization ⋮ Strong Fermat rules for constrained set-valued optimization problems on Banach spaces ⋮ Generalized weak sharp minima in cone-constrained convex optimization with applications ⋮ Conic positive definiteness and sharp minima of fractional orders in vector optimization problems ⋮ Necessary conditions for weak sharp minima in cone-constrained optimization problems ⋮ Positive definiteness of high-order subdifferential and high-order optimality conditions in vector optimization problems ⋮ Weak \(\psi \)-sharp minima in vector optimization problems ⋮ The structure of weak Pareto solution sets in piecewise linear multiobjective optimization in normed spaces ⋮ The Lagrange multiplier rule for super efficiency in vector optimization ⋮ Necessary optimality conditions for weak sharp minima in set-valued optimization ⋮ Error bounds for the difference of two convex multifunctions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strong uniqueness and second order convergence in nonlinear discrete approximation
- On the Clarke subdifferential of the distance function of a closed set
- Strong uniqueness: A far-reaching criterion for the convergence analysis of iterative procedures
- Maximum principle in the problem of time optimal response with nonsmooth constraints
- Optimality conditions in mathematical programming and composite optimization
- Error bounds in mathematical programming
- Strict minimality conditions in nondifferentiable multiobjective programming
- Convex composite non-Lipschitz programming
- A Gauss-Newton method for convex composite optimization
- Hoffman's least error bounds for systems of linear inequalities
- On the Sensitivity Analysis of Hoffman Constants for Systems of Linear Inequalities
- Subsmooth sets: Functional characterizations and related concepts
- Strong uniqueness in sequential linear programming
- Local properties of algorithms for minimizing nonsmooth composite functions
- Optimization and nonsmooth analysis
- Composite Nonsmooth Programming with Gâteaux Differentiability
- Directionally Lipschitzian Functions and Subdifferential Calculus
- Sharp Lipschitz Constants for Basic Optimal Solutions and Basic Feasible Solutions of Linear Programs
- Sharp Estimates for Hoffman's Constant for Systems of Linear Inequalities and Equalities
- Local differentiability of distance functions
- Nonsmooth sequential analysis in Asplund spaces
- Weak Sharp Minima: Characterizations and Sufficient Conditions
- On a Class of Nonsmooth Composite Functions
- Error Bound Moduli for Conic Convex Systems on Banach Spaces
- On convergence of the Gauss-Newton method for convex composite optimization.
- Strict efficiency in vector optimization
This page was built for publication: Sharp minima for multiobjective optimization in Banach spaces
