Global error bounds for piecewise convex polynomials

DOI10.1007/s10107-011-0481-zzbMath1270.90080OpenAlexW1991619142WikidataQ59241498 ScholiaQ59241498MaRDI QIDQ1942267

Guoyin Li

Publication date: 18 March 2013

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

Full work available at URL: https://doi.org/10.1007/s10107-011-0481-z

zbMATH Keywords

Hölder-type global error boundpiecewise convex polynomial

Mathematics Subject Classification ID

Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31)

Related Items

Nonlinear error bounds for quasiconvex inequality systems, Error bounds for the solution sets of generalized polynomial complementarity problems, Primal necessary characterizations of transversality properties, Error bounds for the solution sets of quadratic complementarity problems, On the Complexity Analysis of the Primal Solutions for the Accelerated Randomized Dual Coordinate Ascent, A Lipschitzian error bound for convex quadratic symmetric cone programming, Error bounds for mixed integer nonlinear optimization problems, 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, Robust recovery of low-rank matrices with non-orthogonal sparse decomposition from incomplete measurements, Radius of robust global error bound for piecewise linear inequality systems, Finding the maximum eigenvalue of essentially nonnegative symmetric tensors via sum of squares programming, From error bounds to the complexity of first-order descent methods for convex functions, 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, Robust sensing of low-rank matrices with non-orthogonal sparse decomposition, Characterizing robust local error bounds for linear inequality systems under data uncertainty, Bounds on the objective value of feasible roundings, Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems, Nonlocal error bounds for piecewise affine functions, Thresholding gradient methods in Hilbert spaces: support identification and linear convergence, Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry, On continuous selections of polynomial functions, Robust global error bounds for uncertain linear inequality systems with applications, Linearized proximal algorithms with adaptive stepsizes for convex composite optimization with applications, Coercive polynomials: stability, order of growth, and Newton polytopes, Error bounds for affine variational inequalities with second-order cone constraints, RSG: Beating Subgradient Method without Smoothness and Strong Convexity, 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, Nearly optimal first-order methods for convex optimization under gradient norm measure: an adaptive regularization approach, On the linear convergence of forward-backward splitting method. I: Convergence analysis, Transversality properties: primal sufficient conditions, Faster subgradient methods for functions with Hölderian growth, 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, Some characterizations of error bound for non-lower semicontinuous functions, Accelerate stochastic subgradient method by leveraging local growth condition, Computational approaches to non-convex, sparsity-inducing multi-penalty regularization, Global Error Bounds for Systems of Convex Polynomials over Polyhedral Constraints, Proximal Gradient Methods for Machine Learning and Imaging, Error bounds for approximate solutions of abstract inequality systems and infinite systems of inequalities on Banach spaces, On error bounds for systems, Error bounds for mixed integer linear optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
• Error bound results for generalized D-gap functions of nonsmooth variational inequality problems
• Weak sharp minima revisited. III: Error bounds for differentiable convex inclusions
• Perturbation analysis of a condition number for convex inequality systems and global error bounds for analytic systems
• Error bounds for analytic systems and their applications
• Error bounds in mathematical programming
• Types of upper discontinuities of convex polynomial mappings
• Asymptotic constraint qualifications and global error bounds for convex inequalities.
• Global error bounds with fractional exponents
• A Frank--Wolfe type theorem for convex polynomial programs
• On error bounds for lower semicontinuous functions.
• On generalizations of the Frank-Wolfe theorem to convex and quasi-convex programmes
• Weak sharp minima revisited. II: Application to linear regularity and error bounds
• Error bounds for convex differentiable inequality systems in Banach spaces
• Error Bounds for Lower Semicontinuous Functions in Normed Spaces
• On the Asymptotically Well Behaved Functions and Global Error Bound for Convex Polynomials
• Computable Error Bounds For Convex Inequality Systems In Reflexive Banach Spaces
• On Extension of Fenchel Duality and its Application
• Error Bounds of Generalized D-Gap Functions for Nonsmooth and Nonmonotone Variational Inequality Problems
• Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization
• Error Bounds for Convex Polynomials
• A Condition Number for Differentiable Convex Inequalities
• An Application of Error Bounds for Convex Programming in a Linear Space
• Extension of Hoffman’s Error Bound to Polynomial Systems
• Variational Analysis
• On Projection Algorithms for Solving Convex Feasibility Problems
• Global error bounds for convex quadratic inequality systems^*
• Error Bounds for Piecewise Convex Quadratic Programs and Applications
• Convex Analysis
• Second‐Order Sufficient Conditions for Error Bounds in Banach Spaces
• On types of hausdorff discontinuity from above for convex closed mappings^∗