Weak Sharp Minima: Characterizations and Sufficient Conditions
From MaRDI portal
Publication:4943720
DOI10.1137/S0363012996301269zbMath0946.49011OpenAlexW1971559451MaRDI QIDQ4943720
Publication date: 19 March 2000
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0363012996301269
normal conesubdifferentialdirectional derivativecontingent coneexact penalty functionweak sharp minimizer of order \(m\)
Related Items
On higher-order adjacent derivative of perturbation map in parametric vector optimization ⋮ On applications of the calmness moduli for multifunctions to error bounds ⋮ Inexact subgradient methods for quasi-convex optimization problems ⋮ Sharp minima for multiobjective optimization in Banach spaces ⋮ On Hölder calmness of minimizing sets ⋮ Equivalent properties of global weak sharp minima with applications ⋮ Optimality conditions for weak \({\psi}\) -sharp minima in vector optimization problems ⋮ On higher-order proto-differentiability of perturbation maps ⋮ Structure and weak sharp minimum of the Pareto solution set for piecewise linear multiobjective optimization ⋮ New characterizations of weak sharp minima ⋮ The equivalence of three types of error bounds for weakly and approximately convex functions ⋮ Equivalent conditions for local error bounds ⋮ Isolated calmness and sharp minima via Hölder graphical derivatives ⋮ Strong KKT conditions and weak sharp solutions in convex-composite optimization ⋮ Incremental subgradient algorithms with dynamic step sizes for separable convex optimizations ⋮ Riemannian linearized proximal algorithms for nonnegative inverse eigenvalue problem ⋮ Necessary conditions for weak sharp minima in cone-constrained optimization problems ⋮ Convergence Rate of Inexact Proximal Point Algorithms for Operator with Hölder Metric Subregularity ⋮ A modified inexact Levenberg-Marquardt method with the descent property for solving nonlinear equations ⋮ Higher-Order Optimality Conditions and Higher-Order Tangent Sets ⋮ Linearized proximal algorithms with adaptive stepsizes for convex composite optimization with applications ⋮ Positive definiteness of high-order subdifferential and high-order optimality conditions in vector optimization problems ⋮ Global error bounds for \(\gamma \)-paraconvex multifunctions ⋮ Weak \(\psi \)-sharp minima in vector optimization problems ⋮ Error bounds for vector-valued functions: necessary and sufficient conditions ⋮ Complete characterizations of local weak sharp minima with applications to semi-infinite optimization and complementarity ⋮ On Lipschitz semicontinuity properties of variational systems with application to parametric optimization ⋮ Weak sharp minima for piecewise linear multiobjective optimization in normed spaces ⋮ On metric and calmness qualification conditions in subdifferential calculus ⋮ Convergence Analysis of Gradient Algorithms on Riemannian Manifolds without Curvature Constraints and Application to Riemannian Mass ⋮ The global weak sharp minima with explicit exponents in polynomial vector optimization problems ⋮ Global weak sharp minima for convex (semi-)infinite optimization problems ⋮ Slopes, error bounds and weak sharp Pareto minima of a vector-valued map ⋮ RSG: Beating Subgradient Method without Smoothness and Strong Convexity ⋮ Metric subregularity for composite-convex generalized equations in Banach spaces ⋮ Modified inexact Levenberg-Marquardt methods for solving nonlinear least squares problems ⋮ On global quadratic growth condition for min-max optimization problems with quadratic functions ⋮ Weak sharp efficiency and growth condition for vector-valued functions with applications ⋮ Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs ⋮ Error bounds: necessary and sufficient conditions ⋮ Subsmooth semi-infinite and infinite optimization problems ⋮ Nonconvex weak sharp minima on Riemannian manifolds ⋮ Necessary optimality conditions for weak sharp minima in set-valued optimization ⋮ On error bound moduli for locally Lipschitz and regular functions ⋮ Error bound and well-posedness with respect to an admissible function ⋮ On Convergence Rates of Linearized Proximal Algorithms for Convex Composite Optimization with Applications ⋮ Characterizations of error bounds for lower semicontinuous functions on metric spaces ⋮ Scalarization and optimality conditions for strict minimizers in multiobjective optimization via contingent epiderivatives ⋮ Lipschitz modulus in convex semi-infinite optimizationviad.c. functions ⋮ Directional Quasi-/Pseudo-Normality as Sufficient Conditions for Metric Subregularity ⋮ Convergence rates of subgradient methods for quasi-convex optimization problems ⋮ Global Error Bounds for Systems of Convex Polynomials over Polyhedral Constraints ⋮ Calmness of constraint systems with applications ⋮ Some Dual Conditions for Global Weak Sharp Minimality of Nonconvex Functions
