New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors

From MaRDI portal
Publication:747767


DOI10.1007/s10107-014-0806-9zbMath1327.90237WikidataQ59241466 ScholiaQ59241466MaRDI QIDQ747767

Boris S. Mordukhovich, Guoyin Li, Tiên Sȯn Phạm

Publication date: 19 October 2015

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-014-0806-9


90C26: Nonconvex programming, global optimization

90C31: Sensitivity, stability, parametric optimization

49J52: Nonsmooth analysis

49J53: Set-valued and variational analysis

26D10: Inequalities involving derivatives and differential and integral operators


Related Items

Finding zeros of Hölder metrically subregular mappings via globally convergent Levenberg–Marquardt methods, Spectral Operators of Matrices: Semismoothness and Characterizations of the Generalized Jacobian, Novel Reformulations and Efficient Algorithms for the Generalized Trust Region Subproblem, Hölderian Error Bounds and Kurdyka-Łojasiewicz Inequality for the Trust Region Subproblem, Error bounds for the solution sets of generalized polynomial complementarity problems, Error bounds, facial residual functions and applications to the exponential cone, Preconditioned Algorithm for Difference of Convex Functions with Applications to Graph Ginzburg–Landau Model, Convergence Rate of Inexact Proximal Point Algorithms for Operator with Hölder Metric Subregularity, Well-posedness of fractional Moreau's sweeping processes of Caputo type, Convergence rate of the relaxed CQ algorithm under Hölderian type error bound property, On continuous selections of polynomial functions, Error bounds for mixed integer linear optimization problems, A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure, Stability and genericity for semi-algebraic compact programs, Metric properties of semialgebraic mappings, Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems, Error bounds for mixed integer nonlinear optimization problems, Convergence rate analysis for the higher order power method in best rank one approximations of tensors, Error bounds for the solution sets of quadratic complementarity problems, Local convergence of the heavy-ball method and iPiano for non-convex optimization, Analysis of classifiers' robustness to adversarial perturbations, Genericity and Hölder stability in semi-algebraic variational inequalities, From error bounds to the complexity of first-order descent methods for convex functions, A new nonconvex approach to low-rank matrix completion with application to image inpainting, Error bounds for affine variational inequalities with second-order cone constraints, The global weak sharp minima with explicit exponents in polynomial vector optimization problems, Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods, Kurdyka-Łojasiewicz property of zero-norm composite functions, Error bounds of regularized gap functions for polynomial variational inequalities, On the solution existence and stability of polynomial optimization problems, Global convergence of model function based Bregman proximal minimization algorithms, Kurdyka-Łojasiewicz exponent via inf-projection, Some inequalities on the spectral radius of nonnegative tensors, Bounds on the objective value of feasible roundings, Complementary problems with polynomial data, Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods, Hölder-type global error bounds for non-degenerate polynomial systems, Error bounds for parametric polynomial systems with applications to higher-order stability analysis and convergence rates, Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry, General Hölder smooth convergence rates follow from specialized rates assuming growth bounds, Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems, Local Minimizers of Semi-Algebraic Functions from the Viewpoint of Tangencies



Cites Work