Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
From MaRDI portal
Publication:5956437
Recommendations
- Globally convergent variable metric method for convex nonsmooth unconstrained minimization
- scientific article; zbMATH DE number 4045492
- A variable metric method for nonsmooth convex constrained optimization
- The convergence of variable metric matrices in unconstrained optimization
- scientific article; zbMATH DE number 3915534
- Global convergence of the nonmonotone MBFGS method for nonconvex unconstrained minimization
- Variable metric methods for unconstrained optimization and nonlinear least squares
- Nonconvex approximations in unconstrained minimization
- Inexact variable metric method for convex-constrained optimization problems
- A globally convergent descent method for nonsmooth variational inequalities
Cites work
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- A bundle-Newton method for nonsmooth unconstrained minimization
- A method of linearizations for linearly constrained nonconvex nonsmooth minimization
- An Ellipsoid Trust Region Bundle Method for Nonsmooth Convex Minimization
- Computational experience with known variable metric updates
- Globally convergent variable metric method for convex nonsmooth unconstrained minimization
- Methods of descent for nondifferentiable optimization
- Optimization and nonsmooth analysis
Cited in
(48)- Essentials of numerical nonsmooth optimization
- Structured spectral algorithm with a nonmonotone line search for nonlinear least squares
- Random perturbation of the variable metric method for unconstrained nonsmooth nonconvex optimization
- Nonsmooth optimization via quasi-Newton methods
- Variable metrid method for minimization of partially separable nonsmooth functions
- An extension of the quasi-Newton method for minimizing locally Lipschitz functions
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
- Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization
- Limited memory interior point bundle method for large inequality constrained nonsmooth minimization
- Adaptive limited memory bundle method for bound constrained large-scale nonsmooth optimization
- Using Krylov-Padé model order reduction for accelerating design optimization of structures and vibrations in the frequency domain
- Non-smooth optimization based on resilient backpropagation search for unconstrained and simply bounded problems
- Essentials of numerical nonsmooth optimization
- A quasi-Newton method for unconstrained non-smooth problems
- A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions
- A gradient sampling algorithm for stratified maps with applications to topological data analysis
- Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization
- Subgradient and bundle methods for nonsmooth optimization
- Computing proximal points of nonconvex functions
- On the problem of minimizing a difference of polyhedral convex functions under linear constraints
- A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods
- Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization
- Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions
- Limited-memory BFGS with displacement aggregation
- Optimal control of flow with discontinuities.
- An inexact Newton-like conditional gradient method for constrained nonlinear systems
- A method for non-differentiable optimization problems
- Generalized order-value optimization
- Diagonal discrete gradient bundle method for derivative free nonsmooth optimization
- New limited memory bundle method for large-scale nonsmooth optimization
- A new nonmonotone line search method for nonsmooth nonconvex optimization
- Lagrangian relaxation for continuous-time optimal control of coupled hydrothermal power systems including storage capacity and a cascade of hydropower systems with time delays
- A proximal alternating linearization method for nonconvex optimization problems
- Comparing different nonsmooth minimization methods and software
- A variable metric method for nonsmooth convex constrained optimization
- Constrained nonconvex nonsmooth optimization via proximal bundle method
- A method for nonsmooth optimization problems
- Piecewise linear approximations in nonconvex nonsmooth optimization
- Diagonal bundle method for nonsmooth sparse optimization
- Minimization of marginal functions in mathematical programming based on continuous outer subdifferentials
- A filter-variable-metric method for nonsmooth convex constrained optimization
- New diagonal bundle method for clustering problems in large data sets
- Weak subgradient method for solving nonsmooth nonconvex optimization problems
- Testing different nonsmooth formulations of the Lennard-Jones potential in atomic clustering problems
- Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization
- A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
- The bundle scheme for solving arbitrary eigenvalue optimizations
- A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems
This page was built for publication: Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5956437)
