Strong uniqueness: A far-reaching criterion for the convergence analysis of iterative procedures

DOI10.1007/BF01390337zbMath0352.65012OpenAlexW2912430942MaRDI QIDQ1235956

Publication date: 1978

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/132513

Mathematics Subject Classification ID

General theory of numerical analysis in abstract spaces (65J05) Numerical computation of solutions to systems of equations (65H10) Iterative numerical methods for linear systems (65F10) Algorithms for approximation of functions (65D15)

Related Items

Weak sharp efficiency in multiobjective optimization ⋮ The exact absolute value penalty function method for identifying strict global minima of order \(m\) in nonconvex nonsmooth programming ⋮ Error estimates and Lipschitz constants for best approximation in continuous function spaces ⋮ Sharp minima for multiobjective optimization in Banach spaces ⋮ The prevalence of strong uniqueness in \(L^ 1\) ⋮ A Gauss-Newton method for convex composite optimization ⋮ Robust low transformed multi-rank tensor methods for image alignment ⋮ Linear conditioning, weak sharpness and finite convergence for equilibrium problems ⋮ Strict global minimizers and higher-order generalized strong invexity in multiobjective optimization ⋮ The equivalence of three types of error bounds for weakly and approximately convex functions ⋮ Local properties of inexact methods for minimizing nonsmooth composite functions ⋮ TILT: transform invariant low-rank textures ⋮ Generalized weak sharp minima in cone-constrained convex optimization with applications ⋮ Conic positive definiteness and sharp minima of fractional orders in vector optimization problems ⋮ Higher order strict global minimizers in non-differentiable multiobjective optimization involving higher order invexity and variational inequality ⋮ Higher-order necessary and sufficient conditions for strict local pareto minima in terms of Studniarski's derivatives ⋮ Characterization of vector strict global minimizers of order 2 in differentiable vector optimization problems under a new approximation method ⋮ On isolated/properly efficient solutions in nonsmooth robust semi-infinite multiobjective optimization ⋮ Local strong uniqueness ⋮ Relax-and-split method for nonconvex inverse problems ⋮ Strong uniqueness and second order convergence in nonlinear discrete approximation ⋮ On the convergence of a class of nonlinear approximation methods ⋮ Complete characterizations of local weak sharp minima with applications to semi-infinite optimization and complementarity ⋮ A successive quadratic programming method for a class of constrained nonsmooth optimization problems ⋮ Strong uniqueness, Lipschitz continuity, and continuous selections for metric projections in \(L_1\) ⋮ Higher-order optimality conditions for strict local minima ⋮ Finite termination of inexact proximal point algorithms in Hilbert spaces ⋮ Existence of pseudo-relative sharp minimizers in set-valued optimization ⋮ Variational analysis on local sharp minima via exact penalization ⋮ Global weak sharp minima for convex (semi-)infinite optimization problems ⋮ Isolated efficiency in nonsmooth semi-infinite multi-objective programming ⋮ Characterizations of strict local minima for some nonlinear programming problems ⋮ Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs ⋮ A property of efficient and \(\varepsilon\)-efficient solutions in vector optimization ⋮ Newton-Goldstein convergence rates for convex constrained minimization problems with singular solutions ⋮ Sufficient Conditions of Isolated Minimizers for Constrained Programming Problems ⋮ Unnamed Item ⋮ A characterization of strict local minimizers of order one for nonsmooth static minmax problems ⋮ Subsmooth semi-infinite and infinite optimization problems ⋮ Strict efficiency in vector optimization ⋮ Stability analysis of conically perturbed linearly constrained least-squares problems by optimizing the regularized trajectories ⋮ Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods ⋮ Scalarization and optimality conditions for strict minimizers in multiobjective optimization via contingent epiderivatives ⋮ Sufficient optimality conditions and duality for nonsmooth multiobjective optimization problems via higher order strong convexity ⋮ A unified theory of strong uniqueness in uniform approximation with constraints ⋮ Approximation in normed linear spaces ⋮ A Characterization of Strict Local Minimizers of Order One for Static Minmax Problems in the Parametric Constraint Case ⋮ Convergence analysis of the general Gauss-Newton algorithm ⋮ A review of the parameter estimation problem of fitting positive exponential sums to empirical data ⋮ A projected conjugate gradient method for sparse minimax problems ⋮ Local properties of algorithms for minimizing nonsmooth composite functions ⋮ Characterizations of strict local minima and necessary conditions for weak sharp minima ⋮ Sufficiency and duality in nondifferentiable multiobjective programming involving higher order strong invexity

Cites Work