A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
From MaRDI portal
Publication:3932224
DOI10.1007/BFb0120960zbMath0476.65047OpenAlexW2224698616MaRDI QIDQ3932224
Publication date: 1982
Published in: Mathematical Programming Studies (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0120960
Related Items
A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods, An aggregate subgradient method for nonsmooth and nonconvex minimization, A subgradient selection method for minimizing convex functions subject to linear constraints, Survey of Bundle Methods for Nonsmooth Optimization, Nonconvex bundle method with application to a delamination problem, A constraint linearization method for nondifferentiable convex minimization, A tilted cutting plane proximal bundle method for convex nondifferentiable optimization, A method of linearizations for linearly constrained nonconvex nonsmooth minimization, A Second-Order Bundle Method Based on -Decomposition Strategy for a Special Class of Eigenvalue Optimizations, Descent methods for quasidifferentiable minimization, A proximal alternating linearization method for nonconvex optimization problems, Globally convergent limited memory bundle method for large-scale nonsmooth optimization, A bundle modification strategy for convex minimization, An approximate quasi-Newton bundle-type method for nonsmooth optimization, Solving generation expansion planning problems with environmental constraints by a bundle method, New variants of bundle methods, A descent method with linear programming subproblems for nondifferentiable convex optimization, Rate of convergence of the bundle method, A simple version of bundle method with linear programming, A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information, A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective, Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs, Limited memory interior point bundle method for large inequality constrained nonsmooth minimization, New diagonal bundle method for clustering problems in large data sets, Optimal Convergence Rates for the Proximal Bundle Method, A partially inexact bundle method for convex semi-infinite minmax problems, A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information, Proximity control in bundle methods for convex nondifferentiable minimization, Spectral projected subgradient method for nonsmooth convex optimization problems, Generalized gradients in dynamic optimization, optimal control, and machine learning problems, Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization, Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs, Constrained nonconvex nonsmooth optimization via proximal bundle method, Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization, Diagonal bundle method for nonsmooth sparse optimization, A bundle-type auxiliary problem method for solving generalized variational-like inequalities, Derivative-free optimization via proximal point methods, Computing proximal points of nonconvex functions, A bundle-filter method for nonsmooth convex constrained optimization, Nondifferentiable optimization via smooth approximation: General analytical approach, A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization, A descent algorithm for nonsmooth convex optimization, Minimizing memory effects of a system, An aggregate subgradient method for nonsmooth convex minimization, Non-Euclidean restricted memory level method for large-scale convex optimization, A filter proximal bundle method for nonsmooth nonconvex constrained optimization, Testing different nonsmooth formulations of the Lennard-Jones potential in atomic clustering problems, A proximal bundle method for nonsmooth nonconvex functions with inexact information, Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects, Essentials of numerical nonsmooth optimization, Some experiments on heuristic code selection versus numerical performance in nonlinear programming, Minimizing Piecewise-Concave Functions Over Polyhedra, Diagonal discrete gradient bundle method for derivative free nonsmooth optimization, Duality Results and Dual Bundle Methods Based on the Dual Method of Centers for Minimax Fractional Programs, Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions, A bundle-Newton method for nonsmooth unconstrained minimization, Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions, A method for minimizing the sum of a convex function and a continuously differentiable function, A Proximal Bundle Variant with Optimal Iteration-Complexity for a Large Range of Prox Stepsizes, Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems, Essentials of numerical nonsmooth optimization, A quadratic approximation method for minimizing a class of quasidifferentiable functions, A regularized stochastic decomposition algorithm for two-stage stochastic linear programs, Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization, Implementation of a proximal algorithm for linearly constrained nonsmooth optimization problems and computational results, New variable-metric algorithms for nondifferentiable optimization problems, Decomposition method of descent for minimizing the sum of convex nonsmooth functions, Nonmonotone bundle-type scheme for convex nonsmooth minimization
