Piecewise-quadratic approximations in convex numerical optimization
From MaRDI portal
Publication:3225237
Recommendations
- Piecewise linear approximations in nonconvex nonsmooth optimization
- A bundle Bregman proximal method for convex nondifferentiable minimization
- scientific article; zbMATH DE number 2201296
- Quadratic Approximations in Convex Nondifferentiable Optimization
- A proximal bundle method with inexact data for convex nondifferentiable minimization
Cited in
(28)- Lagrangian relaxation for SVM feature selection
- A method for convex minimization based on translated first-order approximations
- Large-scale unit commitment under uncertainty: an updated literature survey
- An outer approximate subdifferential method for piecewise affine optimization
- Theoretical characteristics and numerical methods for a class of special piecewise quadratic optimization
- Estimating shape parameters of piecewise linear-quadratic problems
- Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
- Large-scale unit commitment under uncertainty
- Piecewise linear approximations in nonconvex nonsmooth optimization
- A simple version of bundle method with linear programming
- Fast bundle-level methods for unconstrained and ball-constrained convex optimization
- Computing the partial conjugate of convex piecewise linear-quadratic bivariate functions
- A doubly stabilized bundle method for nonsmooth convex optimization
- Piecewise quadratic approximation of the non-dominated set for bi-criteria programs
- scientific article; zbMATH DE number 17710 (Why is no real title available?)
- Incremental bundle methods using upper models
- Error Bounds for Piecewise Convex Quadratic Programs and Applications
- Inexact Newton Method for Minimization of Convex Piecewise Quadratic Functions
- A splitting bundle approach for non-smooth non-convex minimization
- Essentials of numerical nonsmooth optimization
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
- Essentials of numerical nonsmooth optimization
- A version of bundle trust region method with linear programming
- A clustering heuristic to improve a derivative-free algorithm for nonsmooth optimization
- Convex hull algorithms for piecewise linear-quadratic functions in computational convex analysis
- Bundle trust region algorithm based on linear subproblem
- A two-point heuristic to calculate the stepsize in subgradient method with application to a network design problem
- Bundle-enhanced column-and-constraint generation method for solving two-stage robust optimization problems
This page was built for publication: Piecewise-quadratic approximations in convex numerical optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3225237)
