A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
From MaRDI portal
Publication:3740142
DOI10.1093/imanum/6.2.137zbMath0603.65041OpenAlexW2053523313MaRDI QIDQ3740142
Publication date: 1986
Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/imanum/6.2.137
numerical examplenonsmooth optimizationsubgradientspositive semidefinite quadratic programming problem
Related Items (33)
Approximations in proximal bundle methods and decomposition of convex programs ⋮ A constraint linearization method for nondifferentiable convex minimization ⋮ Finding normal solutions in piecewise linear programming ⋮ Globally convergent limited memory bundle method for large-scale nonsmooth optimization ⋮ Composite proximal bundle method ⋮ On approximations with finite precision in bundle methods for nonsmooth optimization ⋮ A hybrid approach of bundle and Benders applied large mixed linear integer problem ⋮ A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees ⋮ An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems ⋮ Reflections on generating (disjunctive) cuts ⋮ Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions ⋮ An illumination problem: optimal apex and optimal orientation for a cone of light ⋮ Computing proximal points of nonconvex functions ⋮ A bundle-filter method for nonsmooth convex constrained optimization ⋮ A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization ⋮ Solving nonlinear programming problems with noisy function values and noisy gradients ⋮ The omnipresence of Lagrange ⋮ Regularized decomposition of large scale block-structured robust optimization problems ⋮ Essentials of numerical nonsmooth optimization ⋮ On the numerical realization of the exact penalty method for quadratic programming algorithms ⋮ Duality Results and Dual Bundle Methods Based on the Dual Method of Centers for Minimax Fractional Programs ⋮ Variable-metric technique for the solution of affinely parametrized nondifferentiable optimal design problems ⋮ Solving semidefinite quadratic problems within nonsmooth optimization algorithms ⋮ A splitting bundle approach for non-smooth non-convex minimization ⋮ Efficient hybrid methods for global continuous optimization based on simulated annealing ⋮ Manifold Sampling for $\ell_1$ Nonconvex Optimization ⋮ A \(\mathcal{VU}\)-algorithm for convex minimization ⋮ Revisiting augmented Lagrangian duals ⋮ Essentials of numerical nonsmooth optimization ⋮ An adaptive gradient sampling algorithm for non-smooth optimization ⋮ Minimization of quadratic functionals on cones in Hilbert spaces ⋮ On the rate of convergence of two minimax algorithms ⋮ Convergence of some algorithms for convex minimization
This page was built for publication: A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
