On the Asymptotically Well Behaved Functions and Global Error Bound for Convex Polynomials
From MaRDI portal
Publication:3058515
DOI10.1137/080733668zbMath1208.90135OpenAlexW2094917659WikidataQ59241561 ScholiaQ59241561MaRDI QIDQ3058515
Publication date: 3 December 2010
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/080733668
Convex programming (90C25) Sensitivity, stability, well-posedness (49K40) Sensitivity, stability, parametric optimization (90C31)
Related Items (30)
An invariant-point theorem in Banach space with applications to nonconvex optimization ⋮ Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness ⋮ Hölder-type global error bounds for non-degenerate polynomial systems ⋮ The Z -eigenvalues of a symmetric tensor and its application to spectral hypergraph theory ⋮ Finding the maximum eigenvalue of essentially nonnegative symmetric tensors via sum of squares programming ⋮ Error bounds for parametric polynomial systems with applications to higher-order stability analysis and convergence rates ⋮ Semismoothness of the maximum eigenvalue function of a symmetric tensor and its application ⋮ Error bounds, facial residual functions and applications to the exponential cone ⋮ Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems ⋮ Global error bounds for piecewise convex polynomials ⋮ Minimum recession-compatible subsets of closed convex sets ⋮ Convergence Rate of Inexact Proximal Point Algorithms for Operator with Hölder Metric Subregularity ⋮ Convergence rate of the relaxed CQ algorithm under Hölderian type error bound property ⋮ Error Bounds and Multipliers in Constrained Optimization Problems with Tolerance ⋮ Error bounds for affine variational inequalities with second-order cone constraints ⋮ RSG: Beating Subgradient Method without Smoothness and Strong Convexity ⋮ A new notion of error bounds: necessary and sufficient conditions ⋮ Feasible partition problem in reverse convex and convex mixed-integer programming ⋮ Modified inexact Levenberg-Marquardt methods for solving nonlinear least squares problems ⋮ ŁOJASIEWICZ-TYPE INEQUALITIES AND GLOBAL ERROR BOUNDS FOR NONSMOOTH DEFINABLE FUNCTIONS IN O-MINIMAL STRUCTURES ⋮ Quantitative Analysis for Perturbed Abstract Inequality Systems in Banach Spaces ⋮ Hölder-Like Property and Metric Regularity of a Positive-Order for Implicit Multifunctions ⋮ New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors ⋮ A sufficient condition for asymptotically well behaved property of convex polynomials ⋮ Error bounds and metric subregularity ⋮ Łojasiewicz gradient inequalities for polynomial functions and some applications ⋮ Error bounds of regularized gap functions for polynomial variational inequalities ⋮ Global Error Bounds for Systems of Convex Polynomials over Polyhedral Constraints ⋮ Error bounds for approximate solutions of abstract inequality systems and infinite systems of inequalities on Banach spaces ⋮ On error bounds for systems
This page was built for publication: On the Asymptotically Well Behaved Functions and Global Error Bound for Convex Polynomials
