A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
From MaRDI portal
Publication:3740142
DOI10.1093/IMANUM/6.2.137zbMATH Open0603.65041OpenAlexW2053523313MaRDI QIDQ3740142FDOQ3740142
Authors: Krzysztof C. Kiwiel 
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
Recommendations
nonsmooth optimizationnumerical examplesubgradientspositive semidefinite quadratic programming problem
Cited In (47)
- Title not available (Why is that?)
- Composite proximal bundle method
- Title not available (Why is that?)
- Approximations in proximal bundle methods and decomposition of convex programs
- Regularized decomposition of large scale block-structured robust optimization problems
- Solving nonlinear programming problems with noisy function values and noisy gradients
- On active-set methods for the quadratic programming problem
- On approximations with finite precision in bundle methods for nonsmooth optimization
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
- The omnipresence of Lagrange
- An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems
- Solving nearly-separable quadratic optimization problems as nonsmooth equations
- A bundle-filter method for nonsmooth convex constrained optimization
- On the rate of convergence of two minimax algorithms
- Title not available (Why is that?)
- Essentials of numerical nonsmooth optimization
- Convergence of some algorithms for convex minimization
- Solving semidefinite quadratic problems within nonsmooth optimization algorithms
- On a problem of nonsmooth optimization
- A quadratic programming problem arising from the \(p\)-version for obstacle problems
- Duality results and dual bundle methods based on the dual method of centers for minimax fractional programs
- On a particular quadratic network problem
- A constraint linearization method for nondifferentiable convex minimization
- Computing proximal points of nonconvex functions
- On the numerical realization of the exact penalty method for quadratic programming algorithms
- A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization
- Reflections on generating (disjunctive) cuts
- Algebraic solution of the problems of nonconvex quadratic programming
- Efficient hybrid methods for global continuous optimization based on simulated annealing
- An adaptive gradient sampling algorithm for non-smooth optimization
- Manifold sampling for \(\ell_1\) nonconvex optimization
- A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees
- Finding normal solutions in piecewise linear programming
- Minimization of quadratic functionals on cones in Hilbert spaces
- Revisiting augmented Lagrangian duals
- A splitting bundle approach for non-smooth non-convex minimization
- Manifold sampling for optimizing nonsmooth nonconvex compositions
- Title not available (Why is that?)
- A hybrid approach of bundle and Benders applied large mixed linear integer problem
- Title not available (Why is that?)
- Variable-metric technique for the solution of affinely parametrized nondifferentiable optimal design problems
- An illumination problem: optimal apex and optimal orientation for a cone of light
- A \(\mathcal{VU}\)-algorithm for convex minimization
- A generalized design approach to solution of the non-convex quadratic programming problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Essentials of numerical nonsmooth optimization
This page was built for publication: A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3740142)
