Weak Sharp Minima: Characterizations and Sufficient Conditions
From MaRDI portal
Recommendations
- Necessary conditions for weak sharp minima in cone-constrained optimization problems
- On weak sharp minima for a special class of nonsmooth functions
- scientific article; zbMATH DE number 1304154
- Characterizations of weak sharp minima for lower-\(C^1\) functions
- Characterizations of strict local minima and necessary conditions for weak sharp minima
Cited in
(71)- Scalarization and optimality conditions for strict minimizers in multiobjective optimization via contingent epiderivatives
- Characterizations of strict local minima and necessary conditions for weak sharp minima
- On a sufficient condition for weak sharp efficiency in multiobjective optimization
- The global weak sharp minima with explicit exponents in polynomial vector optimization problems
- Slopes, error bounds and weak sharp Pareto minima of a vector-valued map
- Characterizations of weak sharp minima for lower-\(C^1\) functions
- Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
- On error bound moduli for locally Lipschitz and regular functions
- New characterizations of weak sharp minima
- Equivalent conditions for local error bounds
- Positive definiteness of high-order subdifferential and high-order optimality conditions in vector optimization problems
- Weak \(\psi \)-sharp minima in vector optimization problems
- Modified inexact Levenberg-Marquardt methods for solving nonlinear least squares problems
- On higher-order proto-differentiability of perturbation maps
- Nonconvex weak sharp minima on Riemannian manifolds
- Hölder weak sharp minimizers and Hölder tilt-stability
- Calmness of constraint systems with applications
- Inexact subgradient methods for quasi-convex optimization problems
- The equivalence of three types of error bounds for weakly and approximately convex functions
- On higher-order adjacent derivative of perturbation map in parametric vector optimization
- Isolated calmness and sharp minima via Hölder graphical derivatives
- Linearized proximal algorithms with adaptive stepsizes for convex composite optimization with applications
- On weak sharp minima for a special class of nonsmooth 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
- Some dual conditions for global weak sharp minimality of nonconvex functions
- Weak Sharp Minima in Mathematical Programming
- Weak sharp minima in multiobjective optimization
- Weak sharp minima on Riemannian manifolds
- Weak Sharp Minima for Semi-infinite Optimization Problems with Applications
- Lipschitz modulus in convex semi-infinite optimizationviad.c. functions
- Equivalent properties of global weak sharp minima with applications
- Optimality conditions for weak \({\psi}\) -sharp minima in vector optimization problems
- Necessary conditions for weak sharp minima in cone-constrained optimization problems
- scientific article; zbMATH DE number 1304154 (Why is no real title available?)
- RSG: Beating Subgradient Method without Smoothness and Strong Convexity
- Higher-order optimality conditions and higher-order tangent sets
- Weak sharp efficiency and growth condition for vector-valued functions with applications
- On Lipschitz semicontinuity properties of variational systems with application to parametric optimization
- On applications of the calmness moduli for multifunctions to error bounds
- On Hölder calmness of minimizing sets
- Convergence Analysis of Gradient Algorithms on Riemannian Manifolds without Curvature Constraints and Application to Riemannian Mass
- On global quadratic growth condition for min-max optimization problems with quadratic functions
- Directional quasi-/pseudo-normality as sufficient conditions for metric subregularity
- Global error bounds for systems of convex polynomials over polyhedral constraints
- Metric subregularity for composite-convex generalized equations in Banach spaces
- Characterizations of error bounds for lower semicontinuous functions on metric spaces
- Structure and weak sharp minimum of the Pareto solution set for piecewise linear multiobjective optimization
- Incremental subgradient algorithms with dynamic step sizes for separable convex optimizations
- Riemannian linearized proximal algorithms for nonnegative inverse eigenvalue problem
- 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
- Strong KKT conditions and weak sharp solutions in convex-composite optimization
- Global error bounds for \(\gamma \)-paraconvex multifunctions
- 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
- Uniform weak sharp minima for multiobjective optimization problems
- Convergence of linearized proximal algorithms with adaptive stepsizes for convex composite optimization
- New sufficient and necessary conditions for constrained and unconstrained Lipschitzian error bounds
- Distributed stochastic constrained optimization with constant step-sizes via saddle-point dynamics
- Point-based sufficient conditions for sharp solutions in nonsmooth optimization
- On second-order weak sharp minima of general nonconvex set-constrained optimization problems
- Improved guarantees for optimal Nash equilibrium seeking and bilevel variational inequalities
- Subsmooth semi-infinite and infinite optimization problems
- Convergence rates of subgradient methods for quasi-convex optimization problems
- Sharp minima for multiobjective optimization in Banach spaces
- Weak sharp minima for piecewise linear multiobjective optimization in normed spaces
- On metric and calmness qualification conditions in subdifferential calculus
- Global weak sharp minima for convex (semi-)infinite optimization problems
- Error bounds: necessary and sufficient conditions
- Necessary optimality conditions for weak sharp minima in set-valued optimization
This page was built for publication: Weak Sharp Minima: Characterizations and Sufficient Conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943720)
