Sharp minima for multiobjective optimization in Banach spaces
type: Item
instance of: scholarly article
title: Sharp minima for multiobjective optimization in Banach spaces
zbMATH Open document ID: 1103.49009
author: X. Y. Zheng
author: Xinmin Yang
author: Kok Lay Teo
published in: Set-Valued Analysis
publication date: 2007-01-08T00:00:00Z
Mathematics Subject Classification ID: 49J52
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 5082399
zbMATH Keywords: coderivative
zbMATH Keywords: normal cone
zbMATH Keywords: subdifferential
MaRDI profile type: Publication
full work available at URL: s11228-006-0023-7
OpenAlex ID: W1982248867
cites work: Subsmooth sets: Functional characterizations and related concepts
cites work: On the sensitivity analysis of Hoffman constants for systems of linear inequalities
cites work: Q5478968
cites work: A Gauss-Newton method for convex composite optimization
cites work: On the Clarke subdifferential of the distance function of a closed set
cites work: Optimization and nonsmooth analysis
cites work: Q4856862
cites work: Strong uniqueness: A far-reaching criterion for the convergence analysis of iterative procedures
cites work: Composite Nonsmooth Programming with Gâteaux Differentiability
cites work: Convex composite non-Lipschitz programming
cites work: Strict efficiency in vector optimization
cites work: Strict minimality conditions in nondifferentiable multiobjective programming
cites work: Strong uniqueness and second order convergence in nonlinear discrete approximation
cites work: Q4257334
cites work: Sharp Lipschitz Constants for Basic Optimal Solutions and Basic Feasible Solutions of Linear Programs
cites work: On convergence of the Gauss-Newton method for convex composite optimization.
cites work: Maximum principle in the problem of time optimal response with nonsmooth constraints
cites work: Nonsmooth sequential analysis in Asplund spaces
cites work: Strong uniqueness in sequential linear programming
cites work: Error bounds in mathematical programming
cites work: Optimality conditions in mathematical programming and composite optimization
cites work: Local differentiability of distance functions
cites work: Q3491338
cites work: Directionally Lipschitzian Functions and Subdifferential Calculus
cites work: Q5667036
cites work: On a Class of Nonsmooth Composite Functions
cites work: Weak Sharp Minima: Characterizations and Sufficient Conditions
cites work: Local properties of algorithms for minimizing nonsmooth composite functions
cites work: Sharp Estimates for Hoffman's Constant for Systems of Linear Inequalities and Equalities
cites work: Hoffman's least error bounds for systems of linear inequalities
cites work: Error Bound Moduli for Conic Convex Systems on Banach Spaces
DOI: 10.1007/S11228-006-0023-7
description: scientific article; zbMATH DE number 5082399