On the public citation graph
A descent algorithm for nonsmooth convex optimization
0 signed · 97 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/bf01583790openalex-snapshot
A bundle type approach to the unconstrained minimization of convex nonsmooth functions
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/bfb0120700openalex-snapshot
An extension of davidon methods to non differentiable problems
inferredcites →https://doi.org/10.1007/bfb0120703openalex-snapshot
A method of conjugate subgradients for minimizing nondifferentiable functions
inferredcites →https://doi.org/10.1007/bfb0120960openalex-snapshot
A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
inferredcites →https://doi.org/10.1016/b978-0-12-468662-5.50015-xopenalex-snapshot
ON A BUNDLE ALGORITHM FOR NONSMOOTH OPTIMIZATION
inferredcites →https://doi.org/10.1137/0311049openalex-snapshot
A Descent Numerical Method for Optimization Problems with Nondifferentiable Cost Functionals
inferredcites →https://doi.org/10.1137/0314056openalex-snapshot
Monotone Operators and the Proximal Point Algorithm
inferredcites →https://doi.org/10.1137/siconopenalex-snapshot
SIAM Journal on Control and Optimization
inferredcites →https://doi.org/10.1201/chresnotmthopenalex-snapshot
Research Notes in Mathematics Series
inferredcites →https://doi.org/10.1287/moor.2.2.191openalex-snapshot
An Algorithm for Constrained Optimization with Semismooth Functions
inferredcites →https://doi.org/10.1287/opre.11.3.399openalex-snapshot
Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4613-0239-1_2openalex-snapshot
The Log—Quadratic Proximal Methodology in Convex Optimization Algorithms and Variational Inequalities
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-3-030-19462-8_7openalex-snapshot
Methods for Nonlinearly Constrained Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-34910-3_9openalex-snapshot
Beyond First Order: V U $$\mathcal {V}\mathcal {U}$$ -Decomposition Methods
inferred← citeshttps://doi.org/10.1007/978-981-19-8851-6_42-1openalex-snapshot
Robust Conjugate Gradient Methods for Non-smooth Convex Optimization and Image Processing Problems
inferred← citeshttps://doi.org/10.1007/978-981-97-3820-5_42openalex-snapshot
Robust Conjugate Gradient Methods for Non-smooth Convex Optimization and Image Processing Problems
inferred← citeshttps://doi.org/10.1007/bf00939042openalex-snapshot
Penalty-proximal methods in convex programming
inferred← citeshttps://doi.org/10.1007/bf00939607openalex-snapshot
Nonmonotone bundle-type scheme for convex nonsmooth minimization
inferred← citeshttps://doi.org/10.1007/bf00940519openalex-snapshot
Descent algorithm for a class of convex nondifferentiable functions
inferred← citeshttps://doi.org/10.1007/bf01096777openalex-snapshot
Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems
inferred← citeshttps://doi.org/10.1007/bf01447654openalex-snapshot
A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems
inferred← citeshttps://doi.org/10.1007/bf01580881openalex-snapshot
A class of convergent primal-dual subgradient algorithms for decomposable convex programs
inferred← citeshttps://doi.org/10.1007/bf01585170openalex-snapshot
Convergence of some algorithms for convex minimization
inferred← citeshttps://doi.org/10.1007/bf01585731openalex-snapshot
Proximity control in bundle methods for convex nondifferentiable minimization
inferred← citeshttps://doi.org/10.1007/bf01585756openalex-snapshot
A family of variable metric proximal methods
inferred← citeshttps://doi.org/10.1007/bf01588789openalex-snapshot
A successive quadratic programming method for a class of constrained nonsmooth optimization problems
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/bf02142674openalex-snapshot
Implementation of a proximal algorithm for linearly constrained nonsmooth optimization problems and computational results
inferred← citeshttps://doi.org/10.1007/bf02592098openalex-snapshot
A quasi-second-order proximal bundle algorithm
inferred← citeshttps://doi.org/10.1007/bf02614390openalex-snapshot
Variable metric bundle methods: From conceptual to implementable forms
inferred← citeshttps://doi.org/10.1007/bf02614391openalex-snapshot
A preconditioning proximal newton method for nondifferentiable convex optimization
inferred← citeshttps://doi.org/10.1007/bf02831983openalex-snapshot
A quasi-Newton bundle method based on approximate subgradients
inferred← citeshttps://doi.org/10.1007/bfb0121157openalex-snapshot
Numerical methods for nondifferentiable convex optimization
inferred← citeshttps://doi.org/10.1007/pl00011373openalex-snapshot
On the superlinear convergence of the variable metric proximal point algorithm using Broyden and BFGS matrix secant updating
inferred← citeshttps://doi.org/10.1007/s10107-003-0371-0openalex-snapshot
Epsilon-proximal decomposition method
inferred← citeshttps://doi.org/10.1007/s10107-005-0630-3openalex-snapshot
A -algorithm for convex minimization
inferred← citeshttps://doi.org/10.1007/s101070050059openalex-snapshot
Proximal quasi-Newton methods for nondifferentiable convex optimization
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/s10479-025-07015-7openalex-snapshot
Fast proximal algorithms based on Chebychev centers for nonsmooth optimization
inferred← citeshttps://doi.org/10.1007/s10589-010-9363-1openalex-snapshot
A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization
inferred← citeshttps://doi.org/10.1007/s10589-012-9485-8openalex-snapshot
Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization
inferred← citeshttps://doi.org/10.1007/s10589-018-9999-9openalex-snapshot
An effective adaptive trust region algorithm for nonsmooth minimization
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/s10957-006-9090-zopenalex-snapshot
Tuning Strategy for the Proximity Parameter in Convex Minimization
inferred← citeshttps://doi.org/10.1007/s10957-010-9762-6openalex-snapshot
Cutting Plane Algorithms and Approximate Lower Subdifferentiability
inferred← citeshttps://doi.org/10.1007/s10957-015-0781-1openalex-snapshot
A Modified Hestenes and Stiefel Conjugate Gradient Algorithm for Large-Scale Nonsmooth Minimizations and Nonlinear Equations
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-020-01636-7openalex-snapshot
A Modified Nonlinear Conjugate Gradient Algorithm for Large-Scale Nonsmooth Convex Optimization
inferred← citeshttps://doi.org/10.1007/s11075-022-01349-0openalex-snapshot
A modified conjugate gradient method for general convex functions
inferred← citeshttps://doi.org/10.1007/s11081-021-09705-0openalex-snapshot
Minimizing oracle-structured composite functions
inferred← citeshttps://doi.org/10.1007/s11590-011-0341-zopenalex-snapshot
Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard
inferred← citeshttps://doi.org/10.1007/s11590-011-0437-5openalex-snapshot
Conjugate gradient type methods for the nondifferentiable convex minimization
inferred← citeshttps://doi.org/10.1007/s12190-015-0940-4openalex-snapshot
An ODE-like nonmonotone method for nonsmooth convex optimization
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90209-7openalex-snapshot
An efficient preprocessing procedure for the multidimensional 0–1 knapsack problem
inferred← citeshttps://doi.org/10.1016/0377-2217(94)90401-4openalex-snapshot
A surrogate heuristic for set covering problems
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.2006.04.005openalex-snapshot
A bundle modification strategy for convex minimization
inferred← citeshttps://doi.org/10.1023/a:1004633524446openalex-snapshot
Globally Convergent BFGS Method for Nonsmooth Convex Optimization1
inferred← citeshttps://doi.org/10.1023/a:1008660924636openalex-snapshot
First-Order Algorithms for Generalized Semi-Infinite Min-Max Problems
inferred← citeshttps://doi.org/10.1023/a:1017575415432openalex-snapshot
Minimizing and Stationary Sequences of Convex Constrained Minimization Problems
inferred← citeshttps://doi.org/10.1023/a:1022630801549openalex-snapshot
Convergence Analysis of Some Methods for Minimizing a Nonsmooth Convex Function
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/0020716031000148197openalex-snapshot
A method for nonsmooth optimization problems
inferred← citeshttps://doi.org/10.1080/02331930290019495openalex-snapshot
DYNAMICAL ADJUSTMENT OF THE PROX-PARAMETER IN BUNDLE METHODS
inferred← citeshttps://doi.org/10.1080/10556780802264071openalex-snapshot
Non-smoothness in classification problems
inferred← citeshttps://doi.org/10.1109/fskd.2012.6233910openalex-snapshot
A Compressed Sensing reconstruct algorithm based on trust region method of nonsmooth optimization
inferred← citeshttps://doi.org/10.1137/0329003openalex-snapshot
Quadratic Approximations in Convex Nondifferentiable Optimization
inferred← citeshttps://doi.org/10.1137/0329045openalex-snapshot
A Perturbed Parallel Decomposition Method for a Class of Nonsmooth Convex Minimization Problems
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/s1052623494267127openalex-snapshot
Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
inferred← citeshttps://doi.org/10.1137/s1052623494278839openalex-snapshot
A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization
inferred← citeshttps://doi.org/10.1137/s1052623496303329openalex-snapshot
Quasi-Newton Bundle-Type Methods for Nondifferentiable Convex Optimization
inferred← citeshttps://doi.org/10.1142/s1465876304002411openalex-snapshot
A SUPERLINEARLY CONVERGENT ALGORITHM FOR LARGE SCALE MULTI-STAGE STOCHASTIC NONLINEAR PROGRAMMING
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.1155/2015/145323openalex-snapshot
Multivariate Spectral Gradient Algorithm for Nonsmooth Convex Optimization Problems
inferred← citeshttps://doi.org/10.1287/moor.1030.0062openalex-snapshot
Interior Gradient and Epsilon-Subgradient Descent Methods for Constrained Convex Minimization
inferred← citeshttps://doi.org/10.1371/journal.pone.0164289openalex-snapshot
The Modified HZ Conjugate Gradient Algorithm for Large-Scale Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1371/journal.pone.0189290openalex-snapshot
An active-set algorithm for solving large-scale nonsmooth optimization models with box constraints
inferred← citeshttps://doi.org/10.15807/jorsj.37.297openalex-snapshot
PRIMAL-DUAL PROXIMAL POINT ALGORITHM FOR MULTICOMMODITY NETWORK FLOW PROBLEMS
inferred← citeshttps://doi.org/10.19139/soic-2310-5070-908openalex-snapshot
Wei-Yao-Liu Conjugate Gradient Algorithm for Nonsmooth Convex Optimization Problems
inferred← citeshttps://doi.org/10.19139/soic.v2i3.64openalex-snapshot
A Modified Fletcher-Reeves-Type Method for Nonsmooth Convex Minimization
inferred← citeshttps://doi.org/10.2298/bg20120517gardasevicopenalex-snapshot
Numericke metode za resavanje konveksnih nediferencijabilnih optimizacionih problema
inferred← citeshttps://doi.org/10.3934/jimo.2017075openalex-snapshot
A modified scaled memoryless BFGS preconditioned conjugate gradient algorithm for nonsmooth convex optimization
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.48550/arxiv.1309.0931openalex-snapshot
A global and superlinearly convergent algorithm for nonlinear nondifferential convex programming problems with a generalized Armijo line-search
inferred← citeshttps://doi.org/10.48550/arxiv.2003.03437openalex-snapshot
Proximal bundle algorithms for nonsmooth convex optimization via fast gradient smooth methods
inferred← citeshttps://doi.org/10.68381/jca09033openalex-snapshot
Proximal Points are on the Fast Track
inferred← citeshttps://doi.org/10.9734/bjmcs/2014/12022openalex-snapshot
An Approximate Sequential Bundle Method for Solving a Convex Nondifferentiable Bilevel Programming Problem
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.