A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
From MaRDI portal
Publication:3740142
Recommendations
Cited in
(47)- Manifold sampling for optimizing nonsmooth nonconvex compositions
- Manifold sampling for \(\ell_1\) nonconvex optimization
- On the rate of convergence of two minimax algorithms
- Efficient hybrid methods for global continuous optimization based on simulated annealing
- On a particular quadratic network problem
- Solving semidefinite quadratic problems within nonsmooth optimization algorithms
- A constraint linearization method for nondifferentiable convex minimization
- Computing proximal points of nonconvex functions
- Duality results and dual bundle methods based on the dual method of centers for minimax fractional programs
- A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees
- On approximations with finite precision in bundle methods for nonsmooth optimization
- An illumination problem: optimal apex and optimal orientation for a cone of light
- Minimization of quadratic functionals on cones in Hilbert spaces
- scientific article; zbMATH DE number 3858862 (Why is no real title available?)
- Composite proximal bundle method
- scientific article; zbMATH DE number 3908174 (Why is no real title available?)
- scientific article; zbMATH DE number 5831961 (Why is no real title available?)
- scientific article; zbMATH DE number 3950212 (Why is no real title available?)
- On a problem of nonsmooth optimization
- Revisiting augmented Lagrangian duals
- scientific article; zbMATH DE number 4033492 (Why is no real title available?)
- 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
- An adaptive gradient sampling algorithm for non-smooth optimization
- A hybrid approach of bundle and Benders applied large mixed linear integer problem
- The omnipresence of Lagrange
- Finding normal solutions in piecewise linear programming
- Essentials of numerical nonsmooth optimization
- Regularized decomposition of large scale block-structured robust optimization problems
- Approximations in proximal bundle methods and decomposition of convex programs
- A quadratic programming problem arising from the \(p\)-version for obstacle problems
- Variable-metric technique for the solution of affinely parametrized nondifferentiable optimal design problems
- A splitting bundle approach for non-smooth non-convex minimization
- A \(\mathcal{VU}\)-algorithm for convex minimization
- Solving nonlinear programming problems with noisy function values and noisy gradients
- On active-set methods for the quadratic programming problem
- An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems
- Algebraic solution of the problems of nonconvex quadratic programming
- Convergence of some algorithms for convex minimization
- A generalized design approach to solution of the non-convex quadratic programming problem
- Essentials of numerical nonsmooth optimization
- Solving nearly-separable quadratic optimization problems as nonsmooth equations
- scientific article; zbMATH DE number 1174443 (Why is no real title available?)
- Reflections on generating (disjunctive) cuts
- scientific article; zbMATH DE number 4112388 (Why is no real title available?)
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
- A bundle-filter method for nonsmooth convex constrained 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)
