On solvability of convex noncoercive quadratic programming problems
From MaRDI portal
Publication:1039373
DOI10.1007/s10957-009-9563-yzbMath1175.90307OpenAlexW2032405265MaRDI QIDQ1039373
Publication date: 27 November 2009
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-009-9563-y
Related Items (12)
On the solution existence to convex polynomial programs and its applications ⋮ On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature ⋮ Comparison of active-set and gradient projection-based algorithms for box-constrained quadratic programming ⋮ On the spectrum of Schur complements of 2D elastic clusters joined by rigid edge modes and hybrid domain decomposition ⋮ Extension of Eaves theorem for determining the boundedness of convex quadratic programming problems ⋮ Hybrid TFETI domain decomposition with the clusters joined by faces' rigid modes for solving huge 3D elastic problems ⋮ Exceptional families of elements for optimization problems in reflexive Banach spaces with applications ⋮ Solution existence and stability of quadratically constrained convex quadratic programs ⋮ Minimizing quadratic functions with semidefinite Hessian subject to bound constraints ⋮ Quasistatic normal-compliance contact problem of visco-elastic bodies with Coulomb friction implemented by QP and SGBEM ⋮ Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming ⋮ Complexity and performance of an Augmented Lagrangian algorithm
Cites Work
This page was built for publication: On solvability of convex noncoercive quadratic programming problems
