On the public citation graph
A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
0 signed · 147 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01582105openalex-snapshot
A stable method for solving certain constrained least squares problems
inferredcites →https://doi.org/10.1007/bf01585109openalex-snapshot
Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions
inferredcites →https://doi.org/10.1007/bfb0120957openalex-snapshot
Optimality conditions for piecewise smooth functions
inferredcites →https://doi.org/10.1090/s0002-9947-1975-0367131-6openalex-snapshot
Generalized Gradients and Applications
inferredcites →https://doi.org/10.1137/0315061openalex-snapshot
Semismooth and Semiconvex Functions in Constrained Optimization
inferredcites →https://doi.org/10.1287/moor.2.2.191openalex-snapshot
An Algorithm for Constrained Optimization with Semismooth Functions
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-62598-4_129openalex-snapshot
On a feasible descent algorithm for solving min-max problems
inferred← citeshttps://doi.org/10.1007/978-0-387-34897-1_48openalex-snapshot
Nondifferentiable optimization solver: basic theoretical assumptions
inferred← citeshttps://doi.org/10.1007/978-1-4613-0287-2_13openalex-snapshot
Surver of the Methods for Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4614-0769-0_12openalex-snapshot
Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects
inferred← citeshttps://doi.org/10.1007/978-1-4757-3226-9_6openalex-snapshot
Fixed and virtual stability center methods for convex nonsmooth minimization
inferred← citeshttps://doi.org/10.1007/978-1-4757-5233-5_5openalex-snapshot
Nonsmooth Optimization Methods
inferred← citeshttps://doi.org/10.1007/978-1-4757-6019-4_27openalex-snapshot
The BT-Algorithm for Minimizing a Nonsmooth Functional Subject to Linear Constraints
inferred← citeshttps://doi.org/10.1007/978-3-030-19462-8_7openalex-snapshot
Methods for Nonlinearly Constrained Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-34910-3_12openalex-snapshot
Bundle Methods for Inexact Data
inferred← citeshttps://doi.org/10.1007/978-3-030-34910-3_4openalex-snapshot
A Second Order Bundle Algorithm for Nonsmooth, Nonconvex Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-37826-4_3openalex-snapshot
Nonsmooth Optimization Methods
inferred← citeshttps://doi.org/10.1007/978-3-031-76512-4_3openalex-snapshot
Nonsmooth Optimization Methods
inferred← citeshttps://doi.org/10.1007/978-3-319-23564-6_12openalex-snapshot
Proximal Bundle Method for Nonsmooth and Nonconvex Multiobjective Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-30265-2_18openalex-snapshot
Numerical Methods for Large-Scale Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1007/978-3-662-12603-5_19openalex-snapshot
Descent Methods for Nonsmooth Convex Constrained Minimization
inferred← citeshttps://doi.org/10.1007/978-3-662-12603-5_3openalex-snapshot
Bundle Methods, Cutting-Plane Algorithms and σ-Newton Directions
inferred← citeshttps://doi.org/10.1007/978-3-662-21637-8_11openalex-snapshot
Issues of Effectiveness Arising in the Design of a System of Nondifferentiable Optimization Algorithms
inferred← citeshttps://doi.org/10.1007/bf00939607openalex-snapshot
Nonmonotone bundle-type scheme for convex nonsmooth minimization
inferred← citeshttps://doi.org/10.1007/bf00939925openalex-snapshot
New variable-metric algorithms for nondifferentiable optimization problems
inferred← citeshttps://doi.org/10.1007/bf00940570openalex-snapshot
A method for minimizing the sum of a convex function and a continuously differentiable function
inferred← citeshttps://doi.org/10.1007/bf00941285openalex-snapshot
Decomposition method of descent for minimizing the sum of convex nonsmooth functions
inferred← citeshttps://doi.org/10.1007/bf01299391openalex-snapshot
A regularized stochastic decomposition algorithm for two-stage stochastic linear programs
inferred← citeshttps://doi.org/10.1007/bf01391417openalex-snapshot
A quadratic approximation method for minimizing a class of quasidifferentiable functions
inferred← citeshttps://doi.org/10.1007/bf01397543openalex-snapshot
A constraint linearization method for nondifferentiable convex minimization
inferred← citeshttps://doi.org/10.1007/bf01443620openalex-snapshot
Descent methods for quasidifferentiable minimization
inferred← citeshttps://doi.org/10.1007/bf01580582openalex-snapshot
A method of linearizations for linearly constrained nonconvex nonsmooth minimization
inferred← citeshttps://doi.org/10.1007/bf01582892openalex-snapshot
Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
inferred← citeshttps://doi.org/10.1007/bf01584381openalex-snapshot
A new algorithm for solving variational inequalities with application to the traffic assignment problem
inferred← citeshttps://doi.org/10.1007/bf01585109openalex-snapshot
Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions
inferred← citeshttps://doi.org/10.1007/bf01585731openalex-snapshot
Proximity control in bundle methods for convex nondifferentiable minimization
inferred← citeshttps://doi.org/10.1007/bf01592242openalex-snapshot
A descent method with linear programming subproblems for nondifferentiable convex optimization
inferred← citeshttps://doi.org/10.1007/bf02060937openalex-snapshot
Nondifferentiable optimization via smooth approximation: General analytical approach
inferred← citeshttps://doi.org/10.1007/bf02142674openalex-snapshot
Implementation of a proximal algorithm for linearly constrained nonsmooth optimization problems and computational results
inferred← citeshttps://doi.org/10.1007/bf02239973openalex-snapshot
A subgradient selection method for minimizing convex functions subject to linear constraints
inferred← citeshttps://doi.org/10.1007/bf02591883openalex-snapshot
A descent algorithm for nonsmooth convex optimization
inferred← citeshttps://doi.org/10.1007/bf02591907openalex-snapshot
An aggregate subgradient method for nonsmooth convex minimization
inferred← citeshttps://doi.org/10.1007/bf02680566openalex-snapshot
A bundle-Newton method for nonsmooth unconstrained minimization
inferred← citeshttps://doi.org/10.1007/bfb0007157openalex-snapshot
Finite element approximation of an optimal design problem for free vibrating plates
inferred← citeshttps://doi.org/10.1007/bfb0008364openalex-snapshot
An algorithm for large-scale linearly constrained nondifferentiable convex minimization
inferred← citeshttps://doi.org/10.1007/bfb0008368openalex-snapshot
On the methods of nonsmooth optimization
inferred← citeshttps://doi.org/10.1007/bfb0008904openalex-snapshot
A linearization algorithm for constrained nonsmooth minimization
inferred← citeshttps://doi.org/10.1007/bfb0008905openalex-snapshot
Better than linear convergence and safeguarding in nonsmooth minimization
inferred← citeshttps://doi.org/10.1007/bfb0120066openalex-snapshot
Adaptive variable metric methods for nondifferentiable optimization problems
inferred← citeshttps://doi.org/10.1007/bfb0121139openalex-snapshot
A linearization method for minimizing certain quasidifferentiable functions
inferred← citeshttps://doi.org/10.1007/s00498-014-0135-9openalex-snapshot
Minimizing memory effects of a system
inferred← citeshttps://doi.org/10.1007/s10107-004-0553-4openalex-snapshot
Non-euclidean restricted memory level method for large-scale convex optimization
inferred← citeshttps://doi.org/10.1007/s10107-006-0728-2openalex-snapshot
Globally convergent limited memory bundle method for large-scale nonsmooth optimization
inferred← citeshttps://doi.org/10.1007/s10107-007-0123-7openalex-snapshot
A bundle-filter method for nonsmooth convex constrained optimization
inferred← citeshttps://doi.org/10.1007/s10107-007-0124-6openalex-snapshot
Computing proximal points of nonconvex functions
inferred← citeshttps://doi.org/10.1007/s10107-013-0737-xopenalex-snapshot
Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
inferred← citeshttps://doi.org/10.1007/s10107-023-02035-2openalex-snapshot
A single cut proximal bundle method for stochastic convex composite optimization
inferred← citeshttps://doi.org/10.1007/s10287-012-0139-1openalex-snapshot
Solving generation expansion planning problems with environmental constraints by a bundle method
inferred← citeshttps://doi.org/10.1007/s10288-019-00425-xopenalex-snapshot
Essentials of numerical nonsmooth optimization
inferred← citeshttps://doi.org/10.1007/s10479-021-04498-yopenalex-snapshot
Essentials of numerical nonsmooth optimization
inferred← citeshttps://doi.org/10.1007/s10559-020-00240-xopenalex-snapshot
Generalized Gradients in Dynamic Optimization, Optimal Control, and Machine Learning Problems*
inferred← citeshttps://doi.org/10.1007/s10589-015-9762-4openalex-snapshot
A proximal bundle method for nonsmooth nonconvex functions with inexact information
inferred← citeshttps://doi.org/10.1007/s10589-016-9834-0openalex-snapshot
Nonconvex bundle method with application to a delamination problem
inferred← citeshttps://doi.org/10.1007/s10589-018-0048-5openalex-snapshot
A simple version of bundle method with linear programming
inferred← citeshttps://doi.org/10.1007/s10589-019-00115-8openalex-snapshot
A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization
inferred← citeshttps://doi.org/10.1007/s10898-017-0565-2openalex-snapshot
A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
inferred← citeshttps://doi.org/10.1007/s10898-019-00757-2openalex-snapshot
Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs
inferred← citeshttps://doi.org/10.1007/s10898-020-00939-3openalex-snapshot
A filter proximal bundle method for nonsmooth nonconvex constrained optimization
inferred← citeshttps://doi.org/10.1007/s10957-013-0354-0openalex-snapshot
Derivative-Free Optimization Via Proximal Point Methods
inferred← citeshttps://doi.org/10.1007/s10957-014-0523-9openalex-snapshot
Constrained Nonconvex Nonsmooth Optimization via Proximal Bundle Method
inferred← citeshttps://doi.org/10.1007/s10957-014-0666-8openalex-snapshot
Diagonal Bundle Method for Nonsmooth Sparse Optimization
inferred← citeshttps://doi.org/10.1007/s10957-016-0955-5openalex-snapshot
Testing Different Nonsmooth Formulations of the Lennard–Jones Potential in Atomic Clustering Problems
inferred← citeshttps://doi.org/10.1007/s10957-017-1108-1openalex-snapshot
Rate of Convergence of the Bundle Method
inferred← citeshttps://doi.org/10.1007/s10957-018-1342-1openalex-snapshot
Proximal Bundle Algorithms for Nonlinearly Constrained Convex Minimax Fractional Programs
inferred← citeshttps://doi.org/10.1007/s10957-019-01500-3openalex-snapshot
Nonsmooth and Nonconvex Optimization via Approximate Difference-of-Convex Decompositions
inferred← citeshttps://doi.org/10.1007/s10957-026-02937-zopenalex-snapshot
Proximal Oracles for Optimization and Sampling
inferred← citeshttps://doi.org/10.1007/s10999-008-9077-zopenalex-snapshot
Advances in computational contact mechanics
inferred← citeshttps://doi.org/10.1007/s11075-022-01419-3openalex-snapshot
Spectral projected subgradient method for nonsmooth convex optimization problems
inferred← citeshttps://doi.org/10.1016/0009-2509(90)80175-eopenalex-snapshot
Automatic synthesis of mass-exchange networks with single-component targets
inferred← citeshttps://doi.org/10.1016/0022-247x(85)90061-7openalex-snapshot
An algorithm for linearly constrained convex nondifferentiable minimization problems
inferred← citeshttps://doi.org/10.1016/0167-6377(91)90090-copenalex-snapshot
A tilted cutting plane proximal bundle method for convex nondifferentiable optimization
inferred← citeshttps://doi.org/10.1016/0377-0427(86)90075-0openalex-snapshot
An aggregate subgradient method for nonsmooth and nonconvex minimization
inferred← citeshttps://doi.org/10.1016/0377-2217(93)90108-yopenalex-snapshot
Some experiments on heuristic code selection versus numerical performance in nonlinear programming
inferred← citeshttps://doi.org/10.1016/j.amc.2007.08.044openalex-snapshot
Limited memory interior point bundle method for large inequality constrained nonsmooth minimization
inferred← citeshttps://doi.org/10.1016/j.camwa.2007.11.034openalex-snapshot
A bundle-type auxiliary problem method for solving generalized variational-like inequalities
inferred← citeshttps://doi.org/10.1016/j.cnsns.2014.07.033openalex-snapshot
A partially inexact bundle method for convex semi-infinite minmax problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2017.06.010openalex-snapshot
New diagonal bundle method for clustering problems in large data sets
inferred← citeshttps://doi.org/10.1016/s0020-7403(00)00095-3openalex-snapshot
Solution of dynamic frictional contact problems using nondifferentiable optimization
inferred← citeshttps://doi.org/10.1016/s0169-7161(05)80131-2openalex-snapshot
7 Mathematical programming — A computational perspective
inferred← citeshttps://doi.org/10.1016/s0927-0507(89)01008-xopenalex-snapshot
Chapter VII Nondifferentiable optimization
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)61208-4openalex-snapshot
An Algorithm for Optimization Problems with Singular Values of Control Systems
inferred← citeshttps://doi.org/10.1023/a:1008224107486openalex-snapshot
Global Interval Methods for Local Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1023/a:1019232731587openalex-snapshot
Primal—Dual Constraint Aggregation with Application to Stochastic Programming
inferred← citeshttps://doi.org/10.1023/b:opte.0000042032.47856.e5openalex-snapshot
Parametric Optimization of Hybrid Car Engines
inferred← citeshttps://doi.org/10.1051/ro/2025063openalex-snapshot
Proximal bundle methods for generalized fractional programs with ratios of difference of convex functions
inferred← citeshttps://doi.org/10.1080/01630563.2016.1138969openalex-snapshot
A Second-Order Bundle Method Based on -Decomposition Strategy for a Special Class of Eigenvalue Optimizations
inferred← citeshttps://doi.org/10.1080/02331930902884398openalex-snapshot
Adaptive limited memory bundle method for bound constrained large-scale nonsmooth optimization
inferred← citeshttps://doi.org/10.1080/02331934.2012.687736openalex-snapshot
Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization
inferred← citeshttps://doi.org/10.1080/02331934.2016.1171865openalex-snapshot
Diagonal discrete gradient bundle method for derivative free nonsmooth optimization
inferred← citeshttps://doi.org/10.1080/02331934.2020.1777124openalex-snapshot
Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems
inferred← citeshttps://doi.org/10.1080/02331939208843808openalex-snapshot
Variants to the cutting plane approach for convex nondifferentiable optimization
inferred← citeshttps://doi.org/10.1080/10556780290027828openalex-snapshot
Survey of Bundle Methods for Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1080/10556780802264071openalex-snapshot
Non-smoothness in classification problems
inferred← citeshttps://doi.org/10.1080/10556780902842495openalex-snapshot
Limited memory bundle method for large bound constrained nonsmooth optimization: convergence analysis
inferred← citeshttps://doi.org/10.1080/10556780903236911openalex-snapshot
Gradient set splitting in nonconvex nonsmooth numerical optimization
inferred← citeshttps://doi.org/10.1080/10556788.2013.854358openalex-snapshot
A proximal alternating linearization method for nonconvex optimization problems
inferred← citeshttps://doi.org/10.1080/10556788.2017.1389941openalex-snapshot
Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization
inferred← citeshttps://doi.org/10.1080/10556788.2025.2475518openalex-snapshot
A bundle trust-region algorithm for nonsmooth nonconvex constrained optimization
inferred← citeshttps://doi.org/10.1090/s0025-5718-1985-0790650-5openalex-snapshot
An Algorithm for Nonsmooth Convex Minimization With Errors
inferred← citeshttps://doi.org/10.1093/imanum/drab091openalex-snapshot
A proximal bundle algorithm for nonsmooth optimization on Riemannian manifolds
inferred← citeshttps://doi.org/10.1093/imanum/drz008openalex-snapshot
A self-correcting variable-metric algorithm framework for nonsmooth optimization
inferred← citeshttps://doi.org/10.1109/82.566644openalex-snapshot
Optimal design of partial-band time-varying systems
inferred← citeshttps://doi.org/10.1109/ijcnn.1991.170522openalex-snapshot
Learning in feedforward networks with nonsmooth functions: an I/sub infinity / example
inferred← citeshttps://doi.org/10.1109/wsc57314.2022.10015293openalex-snapshot
A Proximal Algorithm for Sampling from Non-Smooth Potentials
inferred← citeshttps://doi.org/10.1137/040603875openalex-snapshot
An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
inferred← citeshttps://doi.org/10.1137/050647566openalex-snapshot
A Bundle Method for a Class of Bilevel Nonsmooth Convex Minimization Problems
inferred← citeshttps://doi.org/10.1137/0801006openalex-snapshot
Minimization of Locally Lipschitzian Functions
inferred← citeshttps://doi.org/10.1137/0802008openalex-snapshot
A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
inferred← citeshttps://doi.org/10.1137/0804040openalex-snapshot
Large-Scale, Nonlinearly Constrained Optimization on a 1024-Processor n CUBE
inferred← citeshttps://doi.org/10.1137/0806013openalex-snapshot
Restricted Step and Levenberg–Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization
inferred← citeshttps://doi.org/10.1137/090754595openalex-snapshot
A Redistributed Proximal Bundle Method for Nonconvex Optimization
inferred← citeshttps://doi.org/10.1137/18m1199708openalex-snapshot
Duality Results and Dual Bundle Methods Based on the Dual Method of Centers for Minimax Fractional Programs
inferred← citeshttps://doi.org/10.1137/21m1428601openalex-snapshot
Optimal Convergence Rates for the Proximal Bundle Method
inferred← citeshttps://doi.org/10.1137/21m1465445openalex-snapshot
A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods
inferred← citeshttps://doi.org/10.1137/22m1490995openalex-snapshot
A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective
inferred← citeshttps://doi.org/10.1137/s1052623498332336openalex-snapshot
Dual Applications of Proximal Bundle Methods, Including Lagrangian Relaxation of Nonconvex Problems
inferred← citeshttps://doi.org/10.1155/2013/439012openalex-snapshot
Advances in Nonlinear Analysis and Optimization
inferred← citeshttps://doi.org/10.1155/2013/697474openalex-snapshot
An Approximate Quasi-Newton Bundle-Type Method for Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1214/17-ejs1233openalex-snapshot
Optimal prediction for sparse linear models? Lower bounds for coordinate-separable M-estimators
inferred← citeshttps://doi.org/10.1287/ijoo.2022.0073openalex-snapshot
Gradient Sampling Methods with Inexact Subproblem Solutions and Gradient Aggregation
inferred← citeshttps://doi.org/10.1287/moor.10.2.185openalex-snapshot
A Linearization Algorithm for Nonsmooth Minimization
inferred← citeshttps://doi.org/10.1287/moor.13.3.512openalex-snapshot
A Geometrically Convergent Subgradient Optimization Method for Nonlinearly Constrained Convex Programs
inferred← citeshttps://doi.org/10.1287/moor.17.1.112openalex-snapshot
On the Convergence of Algorithms with Implications for Stochastic and Nondifferentiable Optimization
inferred← citeshttps://doi.org/10.1287/moor.2017.0873openalex-snapshot
Minimizing Piecewise-Concave Functions Over Polyhedra
inferred← citeshttps://doi.org/10.1287/moor.2023.1372openalex-snapshot
A Unified Analysis of a Class of Proximal Bundle Methods for Solving Hybrid Convex Composite Optimization Problems
inferred← citeshttps://doi.org/10.1287/moor.8.2.185openalex-snapshot
A Superlinearly Convergent Algorithm for One-Dimensional Constrained Minimization Problems with Convex Functions
inferred← citeshttps://doi.org/10.3390/math8020265openalex-snapshot
Modified Accelerated Bundle-Level Methods and Their Application in Two-Stage Stochastic Programming
inferred← citeshttps://doi.org/10.3934/jimo.2018128openalex-snapshot
Dual algorithms based on the proximal bundle method for solving convex minimax fractional programs
inferred← citeshttps://doi.org/10.3934/jimo.2023057openalex-snapshot
A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information
inferred← citeshttps://doi.org/10.48550/arxiv.1506.07937openalex-snapshot
A feasible second order bundle algorithm for nonsmooth, nonconvex optimization problems with inequality constraints: I. Derivation and convergence
inferred← citeshttps://doi.org/10.48550/arxiv.2003.01562openalex-snapshot
Decomposition of Large Scale Linear Programming Problems Containing both Linking Variables and Constraints via Accuracy Certificates
inferred← citeshttps://doi.org/10.48550/arxiv.2003.11457openalex-snapshot
A proximal bundle variant with optimal iteration-complexity for a large range of prox stepsizes
inferred← citeshttps://doi.org/10.68381/jca22056openalex-snapshot
Bundle Method for Nonconvex Nonsmooth Constrained Optimization
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.