A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems

DOI10.1137/0910013zbMath0663.65063OpenAlexW2073226829MaRDI QIDQ3813167

Krzysztof C. Kiwiel

Publication date: 1989

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0910013

zbMATH Keywords

algorithmquadratic programmingnumerical examplesdual active set methodreduced gradient technique

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20)

Related Items (21)

Elastoplastic analysis of structures under uncertainty: model and solution methods¹ ⋮ Approximations in proximal bundle methods and decomposition of convex programs ⋮ A tilted cutting plane proximal bundle method for convex nondifferentiable optimization ⋮ Finding normal solutions in piecewise linear programming ⋮ Iterative schemes for the least 2-norm solution of piecewise linear programs ⋮ A bundle-type algorithm for routing in telecommunication data networks ⋮ Caputo fractional derivative operational matrices of Legendre and Chebyshev wavelets in fractional delay optimal control ⋮ A cutting plane and level stabilization bundle method with inexact data for minimizing nonsmooth nonconvex functions ⋮ Estimating ordered parameters by linear programming ⋮ Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization ⋮ Discrete gradient method: Derivative-free method for nonsmooth optimization ⋮ A convergent decomposition algorithm for support vector machines ⋮ Comparison of bundle and classical column generation ⋮ Codifferential method for minimizing nonsmooth DC functions ⋮ Solving nonlinear programming problems with noisy function values and noisy gradients ⋮ An Inexact Bundle Algorithm for Nonconvex Nonsmooth Minimization in Hilbert Space ⋮ Parallel decomposition of multistage stochastic programming problems ⋮ Variable-metric technique for the solution of affinely parametrized nondifferentiable optimal design problems ⋮ Solving semidefinite quadratic problems within nonsmooth optimization algorithms ⋮ A primal-proximal heuristic applied to the French unit-commitment problem ⋮ On the rate of convergence of two minimax algorithms

This page was built for publication: A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems