Pages that link to "Item:Q4858775"
From MaRDI portal
The following pages link to Error Bounds for Piecewise Convex Quadratic Programs and Applications (Q4858775):
Displaying 27 items.
- A Lipschitzian error bound for convex quadratic symmetric cone programming (Q312538) (← links)
- Conditioning of linear-quadratic two-stage stochastic optimization problems (Q484135) (← links)
- A global piecewise smooth Newton method for fast large-scale model predictive control (Q644265) (← links)
- New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors (Q747767) (← links)
- New uniform parametric error bounds (Q1265051) (← links)
- On Newton's method for Huber's robust M-estimation problems in linear regression (Q1279695) (← links)
- Perturbation analysis of a condition number for convex inequality systems and global error bounds for analytic systems (Q1290664) (← links)
- Error bounds in mathematical programming (Q1365060) (← links)
- Moving horizon estimation for discrete-time linear systems with binary sensors: algorithms and stability results (Q1679879) (← links)
- Error bounds for affine variational inequalities with second-order cone constraints (Q1728307) (← links)
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods (Q1785009) (← links)
- Error estimates and Lipschitz constants for best approximation in continuous function spaces (Q1904181) (← links)
- Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines (Q1904957) (← links)
- A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines (Q1919811) (← links)
- Global error bounds for piecewise convex polynomials (Q1942267) (← links)
- Error bounds for approximate solutions of abstract inequality systems and infinite systems of inequalities on Banach spaces (Q2116030) (← links)
- Polynomial-time algorithms for submodular Laplacian systems (Q2235770) (← links)
- Hölder-type global error bounds for non-degenerate polynomial systems (Q2405036) (← links)
- Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry (Q2687067) (← links)
- Projection onto a Polyhedron that Exploits Sparsity (Q2817841) (← links)
- Linear Convergence of Descent Methods for the Unconstrained Minimization of Restricted Strongly Convex Functions (Q2821800) (← links)
- Coercive polynomials: stability, order of growth, and Newton polytopes (Q4613988) (← links)
- Proximal Gradient Methods for Machine Learning and Imaging (Q5028165) (← links)
- Generalized Conjugate Gradient Methods for <i>ℓ</i><sub>1</sub> Regularized Convex Quadratic Programming with Finite Convergence (Q5219295) (← links)
- Novel Reformulations and Efficient Algorithms for the Generalized Trust Region Subproblem (Q5231678) (← links)
- Hölderian Error Bounds and Kurdyka-Łojasiewicz Inequality for the Trust Region Subproblem (Q5870365) (← links)
- Error bounds for \(R_0\)-type and monotone nonlinear complementarity problems. (Q5929416) (← links)
