Error Bounds for Piecewise Convex Quadratic Programs and Applications
From MaRDI portal
Publication:4858775
DOI10.1137/S0363012993243022zbMath0836.90125OpenAlexW1975017829MaRDI QIDQ4858775
Publication date: 19 December 1995
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0363012993243022
rate of convergenceglobal error boundproximal point algorithmlocal error estimatelocal error boundmonotone linear complementarity problemaffine variational inequality problempiecewise convex quadratic program
Convex programming (90C25) Nonlinear programming (90C30) Quadratic programming (90C20) Variational inequalities (49J40) Sensitivity, stability, parametric optimization (90C31)
Related Items
A Lipschitzian error bound for convex quadratic symmetric cone programming ⋮ Error estimates and Lipschitz constants for best approximation in continuous function spaces ⋮ Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines ⋮ Error bounds in mathematical programming ⋮ Hölder-type global error bounds for non-degenerate polynomial systems ⋮ A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines ⋮ Moving horizon estimation for discrete-time linear systems with binary sensors: algorithms and stability results ⋮ Global error bounds for piecewise convex polynomials ⋮ Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry ⋮ Convergence rate of the relaxed CQ algorithm under Hölderian type error bound property ⋮ A global piecewise smooth Newton method for fast large-scale model predictive control ⋮ Coercive polynomials: stability, order of growth, and Newton polytopes ⋮ Error bounds for affine variational inequalities with second-order cone constraints ⋮ Conditioning of linear-quadratic two-stage stochastic optimization problems ⋮ Polynomial-time algorithms for submodular Laplacian systems ⋮ Error bounds for \(R_0\)-type and monotone nonlinear complementarity problems. ⋮ Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods ⋮ New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors ⋮ Generalized Conjugate Gradient Methods for ℓ1 Regularized Convex Quadratic Programming with Finite Convergence ⋮ New uniform parametric error bounds ⋮ Projection onto a Polyhedron that Exploits Sparsity ⋮ Linear Convergence of Descent Methods for the Unconstrained Minimization of Restricted Strongly Convex Functions ⋮ Novel Reformulations and Efficient Algorithms for the Generalized Trust Region Subproblem ⋮ On Newton's method for Huber's robust M-estimation problems in linear regression ⋮ Perturbation analysis of a condition number for convex inequality systems and global error bounds for analytic systems ⋮ Hölderian Error Bounds and Kurdyka-Łojasiewicz Inequality for the Trust Region Subproblem ⋮ 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
