A bundle-Newton method for nonsmooth unconstrained minimization

From MaRDI portal
Publication:1290669

DOI10.1007/BF02680566zbMath0920.90132MaRDI QIDQ1290669

Ladislav Lukšan, Jan Vlček

Publication date: 3 June 1999

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)




Related Items

A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions, A bundle method using two polyhedral approximations of the \(\epsilon \)-enlargement of a maximal monotone operator, Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization, Optimization-constrained differential equations with active set changes, A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems, Nonconvex bundle method with application to a delamination problem, An ODE-like nonmonotone method for nonsmooth convex optimization, Dynamic bundle methods, An optimal variant of Kelley's cutting-plane method, A Deep Learning Method for Elliptic Hemivariational Inequalities, Subgradient method for nonconvex nonsmooth optimization, Multivariate spectral gradient algorithm for nonsmooth convex optimization problems, An approximate redistributed proximal bundle method with inexact data for minimizing nonsmooth nonconvex functions, Theory of index-one nonlinear complementarity systems, Lexicographic derivatives of nonsmooth glucose-insulin kinetics under normal and artificial pancreatic responses, Certificates of infeasibility via nonsmooth optimization, An extension of the quasi-Newton method for minimizing locally Lipschitz functions, A method for convex minimization based on translated first-order approximations, A gradient sampling algorithm for stratified maps with applications to topological data analysis, A simple version of bundle method with linear programming, A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information, On the coupling of regularization techniques and the boundary element method for a hemivariational inequality modelling a delamination problem, Generalized order-value optimization, A version of bundle trust region method with linear programming, Adaptive Bundle Methods for Nonlinear Robust Optimization, Numerical infinitesimals in a variable metric method for convex nonsmooth optimization, Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization, Numerical solution of an adhesion problem with FEM and BEM, Conjugate gradient type methods for the nondifferentiable convex minimization, Minimizing oracle-structured composite functions, A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems, A clustering heuristic to improve a derivative-free algorithm for nonsmooth optimization, A new nonmonotone line search method for nonsmooth nonconvex optimization, A Nonsmooth Trust-Region Method for Locally Lipschitz Functions with Application to Optimization Problems Constrained by Variational Inequalities, A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information, Spectral projected subgradient method for nonsmooth convex optimization problems, Sensitivity analysis of nonsmooth power control systems with an example of wind turbines, Nonsmooth DAEs with Applications in Modeling Phase Changes, Interior epigraph directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality, Constrained nonconvex nonsmooth optimization via proximal bundle method, Generalized derivatives for solutions of parametric ordinary differential equations with non-differentiable right-hand sides, Generalized sensitivity analysis of nonlinear programs using a sequence of quadratic programs, A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization, Nonsmooth Hessenberg differential-algebraic equations, Derivative-free optimization via proximal point methods, Aggregate subgradient method for nonsmooth DC optimization, Computing proximal points of nonconvex functions, A bundle-filter method for nonsmooth convex constrained optimization, An adaptive competitive penalty method for nonsmooth constrained optimization, A fast gradient and function sampling method for finite-max functions, A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs, Codifferential method for minimizing nonsmooth DC functions, Bundle Method for Non-Convex Minimization with Inexact Subgradients and Function Values, Approximation of thermoelasticity contact problem with nonmonotone friction, An Inexact Bundle Algorithm for Nonconvex Nonsmooth Minimization in Hilbert Space, Computationally relevant generalized derivatives: theory, evaluation and applications, Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization, Generalized derivatives of differential-algebraic equations, An effective adaptive trust region algorithm for nonsmooth minimization, Trust-Region Methods for the Derivative-Free Optimization of Nonsmooth Black-Box Functions, A proximal bundle method for nonsmooth nonconvex functions with inexact information, Essentials of numerical nonsmooth optimization, Contact problems with nonmonotone friction: Discretization and numerical realization, Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions, Subgradient and Bundle Methods for Nonsmooth Optimization, Determining Key Parameters in Riots Using Lexicographic Directional Differentiation, A priori and a posteriori error estimates for \(hp\)-FEM for a Bingham type variational inequality of the second kind, Weak subgradient method for solving nonsmooth nonconvex optimization problems, A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems, Essentials of numerical nonsmooth optimization, Aggregate codifferential method for nonsmooth DC optimization, An inexact restoration-nonsmooth algorithm with variable accuracy for stochastic nonsmooth convex optimization problems in machine learning and stochastic linear complementarity problems, A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations


Uses Software


Cites Work