Pages that link to "Item:Q1942267"

The following pages link to Global error bounds for piecewise convex polynomials (Q1942267):

Displaying 50 items.

• Error bounds for mixed integer linear optimization problems (Q263186) (← links)
• A Lipschitzian error bound for convex quadratic symmetric cone programming (Q312538) (← links)
• Error bounds for mixed integer nonlinear optimization problems (Q315475) (← links)
• Finding the maximum eigenvalue of essentially nonnegative symmetric tensors via sum of squares programming (Q378284) (← links)
• New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors (Q747767) (← links)
• Primal necessary characterizations of transversality properties (Q830190) (← links)
• Characterizing robust local error bounds for linear inequality systems under data uncertainty (Q891541) (← links)
• Robust global error bounds for uncertain linear inequality systems with applications (Q905714) (← links)
• Error estimates for certain piecewise-polynomial approximations in a plane (Q1311527) (← links)
• Error bounds for the solution sets of quadratic complementarity problems (Q1626539) (← links)
• From error bounds to the complexity of first-order descent methods for convex functions (Q1675251) (← links)
• Error bounds for affine variational inequalities with second-order cone constraints (Q1728307) (← links)
• Semismoothness of the maximum eigenvalue function of a symmetric tensor and its application (Q1931769) (← links)
• Modified inexact Levenberg-Marquardt methods for solving nonlinear least squares problems (Q2007835) (← links)
• Nearly optimal first-order methods for convex optimization under gradient norm measure: an adaptive regularization approach (Q2031939) (← links)
• On the linear convergence of forward-backward splitting method. I: Convergence analysis (Q2031953) (← links)
• Transversality properties: primal sufficient conditions (Q2045184) (← links)
• A sufficient condition for asymptotically well behaved property of convex polynomials (Q2060600) (← links)
• Some characterizations of error bound for non-lower semicontinuous functions (Q2067750) (← links)
• Error bounds for approximate solutions of abstract inequality systems and infinite systems of inequalities on Banach spaces (Q2116030) (← links)
• Bounds on the objective value of feasible roundings (Q2189630) (← links)
• Faster subgradient methods for functions with Hölderian growth (Q2297653) (← links)
• On error bounds for systems (Q2355015) (← links)
• Nonlinear error bounds for quasiconvex inequality systems (Q2361132) (← links)
• Hölder-type global error bounds for non-degenerate polynomial systems (Q2405036) (← links)
• Error bounds for parametric polynomial systems with applications to higher-order stability analysis and convergence rates (Q2413090) (← links)
• Robust recovery of low-rank matrices with non-orthogonal sparse decomposition from incomplete measurements (Q2662546) (← links)
• Radius of robust global error bound for piecewise linear inequality systems (Q2664894) (← links)
• Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry (Q2687067) (← links)
• Linearized proximal algorithms with adaptive stepsizes for convex composite optimization with applications (Q2694483) (← links)
• Łojasiewicz-type inequalities and global error bounds for nonsmooth definable functions in o-minimal structures (Q2786583) (← links)
• Global Hölderian error bound for nondegenerate polynomials (Q2848179) (← links)
• The <i>Z</i> -eigenvalues of a symmetric tensor and its application to spectral hypergraph theory (Q2936746) (← links)
• Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems (Q2954171) (← links)
• On the Asymptotically Well Behaved Functions and Global Error Bound for Convex Polynomials (Q3058515) (← links)
• (Q4448960) (← links)
• RSG: Beating Subgradient Method without Smoothness and Strong Convexity (Q4558142) (← links)
• Coercive polynomials: stability, order of growth, and Newton polytopes (Q4613988) (← links)
• Quantitative Analysis for Perturbed Abstract Inequality Systems in Banach Spaces (Q4687244) (← links)
• On the Complexity Analysis of the Primal Solutions for the Accelerated Randomized Dual Coordinate Ascent (Q4969070) (← links)
• Computational approaches to non-convex, sparsity-inducing multi-penalty regularization (Q4989924) (← links)
• Proximal Gradient Methods for Machine Learning and Imaging (Q5028165) (← links)
• Thresholding gradient methods in Hilbert spaces: support identification and linear convergence (Q5109200) (← links)
• Accelerate stochastic subgradient method by leveraging local growth condition (Q5236746) (← links)
• Global Error Bounds for Systems of Convex Polynomials over Polyhedral Constraints (Q5252585) (← links)
• Error bounds for the solution sets of generalized polynomial complementarity problems (Q5887660) (← links)
• Error bounds, facial residual functions and applications to the exponential cone (Q6044980) (← links)
• Robust sensing of low-rank matrices with non-orthogonal sparse decomposition (Q6051152) (← links)
• Nonlocal error bounds for piecewise affine functions (Q6080421) (← links)
• Distributed accelerated gradient methods with restart under quadratic growth condition (Q6607027) (← links)