A bundle-Newton method for nonsmooth unconstrained minimization
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 3874967 (Why is no real title available?)
- scientific article; zbMATH DE number 3880447 (Why is no real title available?)
- scientific article; zbMATH DE number 53965 (Why is no real title available?)
- scientific article; zbMATH DE number 3619635 (Why is no real title available?)
- 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 modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- An Ellipsoid Trust Region Bundle Method for Nonsmooth Convex Minimization
- Ideas for developing a rapidly convergent algorithm for nonsmooth minimization
- Methods of descent for nondifferentiable optimization
- Newton's method for convex programming and Tschebyscheff approximation
- Newton-type methods for unconstrained and linearly constrained optimization
- Optimization and nonsmooth analysis
- Restricted Step and Levenberg–Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization
- The Cutting-Plane Method for Solving Convex Programs
Cited in
(83)- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
- A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems
- Essentials of numerical nonsmooth optimization
- Nonconvex bundle method with application to a delamination problem
- Trust-region methods for the derivative-free optimization of nonsmooth black-box functions
- Optimization-constrained differential equations with active set changes
- Nonsmooth Hessenberg differential-algebraic equations
- Constructing a subgradient from directional derivatives for functions of two variables
- Spectral projected subgradient method for nonsmooth convex optimization problems
- Codifferential method for minimizing nonsmooth DC functions
- An inexact restoration-nonsmooth algorithm with variable accuracy for stochastic nonsmooth convex optimization problems in machine learning and stochastic linear complementarity problems
- Sensitivity analysis of nonsmooth power control systems with an example of wind turbines
- An extension of the quasi-Newton method for minimizing locally Lipschitz functions
- A bundle method using two polyhedral approximations of the -enlargement of a maximal monotone operator
- scientific article; zbMATH DE number 5653878 (Why is no real title available?)
- Aggregate subgradient method for nonsmooth DC optimization
- Numerical solution of an adhesion problem with FEM and BEM
- A Deep Learning Method for Elliptic Hemivariational Inequalities
- Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization
- A priori and a posteriori error estimates for hp-FEM for a Bingham type variational inequality of the second kind
- Numerical infinitesimals in a variable metric method for convex nonsmooth optimization
- A bundle-filter method for nonsmooth convex constrained optimization
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
- A fast gradient and function sampling method for finite-max functions
- Essentials of numerical nonsmooth optimization
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
- scientific article; zbMATH DE number 123281 (Why is no real title available?)
- A Bundle Method for a Class of Bilevel Nonsmooth Convex Minimization Problems
- A gradient sampling algorithm for stratified maps with applications to topological data analysis
- Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
- Subgradient and bundle methods for nonsmooth optimization
- Computing proximal points of nonconvex functions
- An Inexact Bundle Algorithm for Nonconvex Nonsmooth Minimization in Hilbert Space
- Generalized derivatives of differential-algebraic equations
- Minimizing oracle-structured composite functions
- scientific article; zbMATH DE number 1584097 (Why is no real title available?)
- Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
- Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions
- A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information
- A clustering heuristic to improve a derivative-free algorithm for nonsmooth optimization
- Aggregate codifferential method for nonsmooth DC optimization
- Dynamic bundle methods
- A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization
- Generalized order-value optimization
- Adaptive Bundle Methods for Nonlinear Robust Optimization
- Theory of index-one nonlinear complementarity systems
- Lexicographic derivatives of nonsmooth glucose-insulin kinetics under normal and artificial pancreatic responses
- An ODE-like nonmonotone method for nonsmooth convex optimization
- An effective adaptive trust region algorithm for nonsmooth minimization
- An approximate redistributed proximal bundle method with inexact data for minimizing nonsmooth nonconvex functions
- On the coupling of regularization techniques and the boundary element method for a hemivariational inequality modelling a delamination problem
- A new nonmonotone line search method for nonsmooth nonconvex optimization
- A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions
- Interior epigraph directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality
- \textit{hp}-FEM for the \(\alpha\)-Mosolov problem: a priori and a posteriori error estimates
- Multivariate spectral gradient algorithm for nonsmooth convex optimization problems
- Certificates of infeasibility via nonsmooth optimization
- An optimal variant of Kelley's cutting-plane method
- A version of bundle trust region method with linear programming
- Constrained nonconvex nonsmooth optimization via proximal bundle method
- Generalized derivatives for solutions of parametric ordinary differential equations with non-differentiable right-hand sides
- Implementation of an oracle-structured bundle method for distributed optimization
- Subgradient method for nonconvex nonsmooth optimization
- Piecewise linear approximations in nonconvex nonsmooth optimization
- A method for convex minimization based on translated first-order approximations
- Determining key parameters in riots using lexicographic directional differentiation
- Generalized sensitivity analysis of nonlinear programs using a sequence of quadratic programs
- Bundle method for non-convex minimization with inexact subgradients and function values
- Contact problems with nonmonotone friction: Discretization and numerical realization
- Computing subgradients of convex relaxations for solutions of parametric ordinary differential equations
- Weak subgradient method for solving nonsmooth nonconvex optimization problems
- Derivative-free optimization via proximal point methods
- A nonsmooth trust-region method for locally Lipschitz functions with application to optimization problems constrained by variational inequalities
- Computationally relevant generalized derivatives: theory, evaluation and applications
- Approximation of thermoelasticity contact problem with nonmonotone friction
- Generalized derivatives of optimal-value functions with parameterized convex programs embedded
- Conjugate gradient type methods for the nondifferentiable convex minimization
- A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems
- Nonsmooth DAEs with applications in modeling phase changes
- A simple version of bundle method with linear programming
- A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems
- An adaptive competitive penalty method for nonsmooth constrained optimization
This page was built for publication: A bundle-Newton method for nonsmooth unconstrained minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290669)
