Pages that link to "Item:Q3740142"
From MaRDI portal
The following pages link to A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization (Q3740142):
Displaying 33 items.
- Composite proximal bundle method (Q359623) (← links)
- A hybrid approach of bundle and Benders applied large mixed linear integer problem (Q364462) (← links)
- Reflections on generating (disjunctive) cuts (Q458126) (← links)
- On approximations with finite precision in bundle methods for nonsmooth optimization (Q597165) (← links)
- An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems (Q647397) (← links)
- Solving nonlinear programming problems with noisy function values and noisy gradients (Q700766) (← links)
- On the numerical realization of the exact penalty method for quadratic programming algorithms (Q751516) (← links)
- Minimization of quadratic functionals on cones in Hilbert spaces (Q805165) (← links)
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization (Q868454) (← links)
- A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees (Q903922) (← links)
- Computing proximal points of nonconvex functions (Q959941) (← links)
- A bundle-filter method for nonsmooth convex constrained optimization (Q959944) (← links)
- A constraint linearization method for nondifferentiable convex minimization (Q1099787) (← links)
- A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization (Q1205504) (← links)
- On the rate of convergence of two minimax algorithms (Q1321092) (← links)
- Convergence of some algorithms for convex minimization (Q1321649) (← links)
- Regularized decomposition of large scale block-structured robust optimization problems (Q1789623) (← links)
- Variable-metric technique for the solution of affinely parametrized nondifferentiable optimal design problems (Q1824569) (← links)
- Approximations in proximal bundle methods and decomposition of convex programs (Q1893328) (← links)
- Finding normal solutions in piecewise linear programming (Q1900115) (← links)
- Revisiting augmented Lagrangian duals (Q2097636) (← links)
- An illumination problem: optimal apex and optimal orientation for a cone of light (Q2250115) (← links)
- Solving semidefinite quadratic problems within nonsmooth optimization algorithms (Q2564758) (← links)
- Efficient hybrid methods for global continuous optimization based on simulated annealing (Q2571196) (← links)
- A \(\mathcal{VU}\)-algorithm for convex minimization (Q2576737) (← links)
- An adaptive gradient sampling algorithm for non-smooth optimization (Q2867436) (← links)
- Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions (Q5162654) (← links)
- Duality Results and Dual Bundle Methods Based on the Dual Method of Centers for Minimax Fractional Programs (Q5231677) (← links)
- A splitting bundle approach for non-smooth non-convex minimization (Q5248228) (← links)
- Manifold Sampling for $\ell_1$ Nonconvex Optimization (Q5506685) (← links)
- Essentials of numerical nonsmooth optimization (Q5918756) (← links)
- The omnipresence of Lagrange (Q5920487) (← links)
- Essentials of numerical nonsmooth optimization (Q5970841) (← links)
