On the public citation graph
Numerical methods for nondifferentiable convex optimization
0 signed · 141 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/978-1-4613-8165-5openalex-snapshot
Optimization—Theory and Applications
inferredcites →https://doi.org/10.1007/bf01448388openalex-snapshot
Partial inverse of a monotone operator
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/bf02591883openalex-snapshot
A descent algorithm for nonsmooth convex optimization
inferredcites →https://doi.org/10.1007/bf02591907openalex-snapshot
An aggregate subgradient method for nonsmooth convex minimization
inferredcites →https://doi.org/10.1007/bf02594782openalex-snapshot
ε-Optimal solutions in nondifferentiable convex programming and some related questions
inferredcites →https://doi.org/10.1007/bfb0069442openalex-snapshot
Conference on Applications of Numerical Analysis
inferredcites →https://doi.org/10.1007/bfb0069445openalex-snapshot
Minimisation de Fonctionnelles Non-Differentiables
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.1016/0377-0427(84)90051-7openalex-snapshot
On the convergence of a class of outer approximation algorithms for convex programs
inferredcites →https://doi.org/10.1051/m2an/196802r100431openalex-snapshot
Programmation mathématique convexe
inferredcites →https://doi.org/10.1051/m2an/197004r301541openalex-snapshot
Brève communication. Régularisation d'inéquations variationnelles par approximations successives
inferredcites →https://doi.org/10.1090/s0002-9939-1965-0178103-8openalex-snapshot
On the subdifferentiability of convex functions
inferredcites →https://doi.org/10.1137/0314056openalex-snapshot
Monotone Operators and the Proximal Point Algorithm
inferredcites →https://doi.org/10.1137/1.9780898719468openalex-snapshot
Iterative Solution of Nonlinear Equations in Several Variables
inferredcites →https://doi.org/10.1287/moor.1.2.97openalex-snapshot
Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
inferredcites →https://doi.org/10.1287/moor.8.2.185openalex-snapshot
A Superlinearly Convergent Algorithm for One-Dimensional Constrained Minimization Problems with Convex Functions
inferredcites →https://doi.org/10.1287/opre.31.1.101openalex-snapshot
An Outer Approximation Algorithm for Solving General Convex Programs
inferredcites →https://doi.org/10.2307/2004942openalex-snapshot
Iterative Solution of Nonlinear Equations in Several Variables
inferredcites →https://doi.org/10.2307/2033889openalex-snapshot
On the Subdifferentiability of Convex 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/0-306-48332-7_204openalex-snapshot
Sensitivity and stability in NLP ILL-POSED VARIATIONAL PROBLEMS
inferred← citeshttps://doi.org/10.1007/11496199_5openalex-snapshot
An Algorithm for Nonconvex Lower Semicontinuous Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_273openalex-snapshot
Ill-posed Variational Problems
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-4613-0287-2_13openalex-snapshot
Surver of the Methods for Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4613-0287-2_25openalex-snapshot
Proximal Methods for Variational Inequalities with Set-Valued Monotone Operators
inferred← citeshttps://doi.org/10.1007/978-1-4757-3226-9_22openalex-snapshot
A Comparison of Rates of Convergence of Two Inexact Proximal Point Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4757-5233-5_5openalex-snapshot
Nonsmooth Optimization Methods
inferred← citeshttps://doi.org/10.1007/978-3-030-34910-3_13openalex-snapshot
New Multiobjective Proximal Bundle Method with Scaled Improvement Function
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-3-030-54621-2_273-1openalex-snapshot
Ill-posed Variational Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-45780-7_12openalex-snapshot
Proximal and Dynamical Approaches to Equilibrium Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-45780-7_9openalex-snapshot
A Projection-Proximal Bundle Method for Convex Nondifferentiable Minimization
inferred← citeshttps://doi.org/10.1007/978-3-642-59073-3_10openalex-snapshot
Multi–Step Proximal Method for Variational Inequalities with Monotone Operators
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/bf01204180openalex-snapshot
The perturbed proximal point algorithm and some of its applications
inferred← citeshttps://doi.org/10.1007/bf01582566openalex-snapshot
A proximal-based decomposition method for convex minimization problems
inferred← citeshttps://doi.org/10.1007/bf01585170openalex-snapshot
Convergence of some algorithms for convex minimization
inferred← citeshttps://doi.org/10.1007/bf01585559openalex-snapshot
A continuation method for monotone variational inequalities
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/bf01586942openalex-snapshot
Penalization in non-classical convex programming via variational convergence
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/bf02192181openalex-snapshot
Generalized proximal point algorithm for convex optimization
inferred← citeshttps://doi.org/10.1007/bf02192537openalex-snapshot
Family of perturbation methods for variational inequalities
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/bf02669680openalex-snapshot
A decomposition method for convex minimization problems and its application
inferred← citeshttps://doi.org/10.1007/bfb0008364openalex-snapshot
An algorithm for large-scale linearly constrained nondifferentiable convex minimization
inferred← citeshttps://doi.org/10.1007/s00158-011-0634-yopenalex-snapshot
A feasible directions method for nonsmooth convex optimization
inferred← citeshttps://doi.org/10.1007/s10107-002-0295-0openalex-snapshot
Primal and dual convergence of a proximal point exponential penalty method for linear programming
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/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-016-0985-7openalex-snapshot
An optimal variant of Kelley’s cutting-plane method
inferred← citeshttps://doi.org/10.1007/s10107-022-01903-7openalex-snapshot
Principled analyses and design of first-order methods with inexact proximal operators
inferred← citeshttps://doi.org/10.1007/s101070050022openalex-snapshot
Error bounds for proximal point subproblems and associated inexact proximal point algorithms
inferred← citeshttps://doi.org/10.1007/s101070050056openalex-snapshot
A bundle Bregman proximal method for convex nondifferentiable minimization
inferred← citeshttps://doi.org/10.1007/s101070050059openalex-snapshot
Proximal quasi-Newton methods for nondifferentiable convex optimization
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/s10957-018-01469-5openalex-snapshot
Accelerated Randomized Mirror Descent Algorithms for Composite Non-strongly Convex Optimization
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/s11075-018-0565-4openalex-snapshot
Convergence rates of accelerated proximal gradient algorithms under independent noise
inferred← citeshttps://doi.org/10.1007/s11081-005-6798-9openalex-snapshot
Inexact Proximal Point Algorithms and Descent Methods in Optimization
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/b978-0-12-814788-7.00008-4openalex-snapshot
Mathematical Background
inferred← citeshttps://doi.org/10.1016/b978-0-12-814788-7.00009-6openalex-snapshot
Convex Programming
inferred← citeshttps://doi.org/10.1016/b978-0-12-814788-7.00012-6openalex-snapshot
Optimal Control of Hybrid and Switched Systems
inferred← citeshttps://doi.org/10.1016/b978-0-12-814788-7.00013-8openalex-snapshot
Numerically Tractable Relaxation Schemes for Optimal Control of Hybrid and Switched Systems
inferred← citeshttps://doi.org/10.1016/b978-0-12-814788-7.00014-xopenalex-snapshot
Applications of the Relaxation-Based Approach
inferred← citeshttps://doi.org/10.1016/j.amc.2007.03.059openalex-snapshot
A new trust region algorithm for nonsmooth convex minimization
inferred← citeshttps://doi.org/10.1016/j.na.2011.07.066openalex-snapshot
Alternating proximal algorithms for linearly constrained variational inequalities: Application to domain decomposition for PDE’s
inferred← citeshttps://doi.org/10.1017/s0334270000010912openalex-snapshot
Solvability of generalized nonlinear symmetric variational inequalities
inferred← citeshttps://doi.org/10.1023/a:1004633524446openalex-snapshot
Globally Convergent BFGS Method for Nonsmooth Convex Optimization1
inferred← citeshttps://doi.org/10.1023/a:1008282922372openalex-snapshot
Comparing Nonsmooth Nonconvex Bundle Methods in Solving Hemivariational Inequalities
inferred← citeshttps://doi.org/10.1023/a:1008321423879openalex-snapshot
Proximal Point Methods and Nonconvex Optimization
inferred← citeshttps://doi.org/10.1023/a:1008777829180openalex-snapshot
A Hybrid Approximate Extragradient – Proximal Point Algorithm Using the Enlargement of a Maximal Monotone Operator
inferred← citeshttps://doi.org/10.1023/a:1011264006379openalex-snapshot
Some Properties of Methods of Centers
inferred← citeshttps://doi.org/10.1023/a:1017523331361openalex-snapshot
Robustness of the Hybrid Extragradient Proximal-Point Algorithm
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:1022243127667openalex-snapshot
Prox-regularization and solution of ill-posed elliptic variational inequalities
inferred← citeshttps://doi.org/10.1023/a:1022621905645openalex-snapshot
Coupling the Proximal Point Algorithm with Approximation Methods
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/m2an/1994280201891openalex-snapshot
The perturbed Tikhonov's algorithm and some of its applications
inferred← citeshttps://doi.org/10.1080/00207160.2014.955483openalex-snapshot
A memory gradient method for non-smooth convex optimization
inferred← citeshttps://doi.org/10.1080/01630569608816705openalex-snapshot
Convergence analysis of a proximal newton method1
inferred← citeshttps://doi.org/10.1080/02331930290019404openalex-snapshot
NUMERICAL APPROACH TO A STATIONARY SOLUTION OF A SECOND ORDER DISSIPATIVE DYNAMICAL SYSTEM
inferred← citeshttps://doi.org/10.1080/02331930290019495openalex-snapshot
DYNAMICAL ADJUSTMENT OF THE PROX-PARAMETER IN BUNDLE METHODS
inferred← citeshttps://doi.org/10.1080/02331930801951389openalex-snapshot
A note on the convergence of an inertial version of a diagonal hybrid projection-point algorithm
inferred← citeshttps://doi.org/10.1080/02331930903395857openalex-snapshot
Proximal-type methods with generalized Bregman functions and applications to generalized fractional programming
inferred← citeshttps://doi.org/10.1080/02331934.2011.592528openalex-snapshot
Hybrid extragradient proximal algorithm coupled with parametric approximation and penalty/barrier methods
inferred← citeshttps://doi.org/10.1080/02331934.2021.2002327openalex-snapshot
Accelerated differential inclusion for convex optimization
inferred← citeshttps://doi.org/10.1080/02331934.2023.2264861openalex-snapshot
On the diagonal proximal point algorithms
inferred← citeshttps://doi.org/10.1080/02331939408843968openalex-snapshot
About saddle values of a class of convex-concave functions
inferred← citeshttps://doi.org/10.1080/02331939508844083openalex-snapshot
Multi-step-prox-regularization method for solving convex variation problems
inferred← citeshttps://doi.org/10.1080/02331939608844217openalex-snapshot
Combining The Proximal Algorithm And Tikhonov Regularization
inferred← citeshttps://doi.org/10.1080/10556780290027828openalex-snapshot
Survey of Bundle Methods for Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1080/10556780410001704902openalex-snapshot
𝒱𝒰-smoothness and proximal point results for some nonconvex functions
inferred← citeshttps://doi.org/10.1080/10556780701549960openalex-snapshot
On the global convergence of a nonmonotone proximal bundle method for convex nonsmooth minimization
inferred← citeshttps://doi.org/10.1137/0328029openalex-snapshot
A Generalization of the Proximal Point Algorithm
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/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/110844805openalex-snapshot
Accelerated and Inexact Forward-Backward Algorithms
inferred← citeshttps://doi.org/10.1137/s0363012995281742openalex-snapshot
Proximal Minimization Methods with Generalized Bregman Functions
inferred← citeshttps://doi.org/10.1137/s0363012998333116openalex-snapshot
Proximal Point Approach and Approximation of Variational Inequalities
inferred← citeshttps://doi.org/10.1137/s105262340343467xopenalex-snapshot
Proximal Point Algorithm Controlled by a Slowly Vanishing Term: Applications to Hierarchical Minimization
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/s1052623495288064openalex-snapshot
Proximal Decomposition Via Alternating Linearization
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/2012/215160openalex-snapshot
A Decomposition Algorithm for Convex Nondifferentiable Minimization with Errors
inferred← citeshttps://doi.org/10.1155/2020/3108056openalex-snapshot
Theoretical Aspect of Diagonal Bregman Proximal Methods
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.1287/moor.1050.0156openalex-snapshot
Convergence of a Hybrid Projection-Proximal Point Algorithm Coupled with Approximation Methods in Convex Optimization
inferred← citeshttps://doi.org/10.15807/jorsj.36.1openalex-snapshot
A PRACTICAL APPROACH TO DECOMPOSABLE NONLINEAR PROGRAMMING 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.3934/jimo.2017075openalex-snapshot
A modified scaled memoryless BFGS preconditioned conjugate gradient algorithm for nonsmooth convex optimization
inferred← citeshttps://doi.org/10.68381/jca09033openalex-snapshot
Proximal Points are on the Fast Track
inferred← citeshttps://doi.org/10.68381/jca17050openalex-snapshot
On some Curvature-Dependent Steplength for the Gradient Method
inferred← citeshttps://doi.org/10.70675/01919188z8e7ez4f5bzb5f9z00dfab7963b6openalex-snapshot
Interprétation et amélioration d’une procédure de démodulation itérative
inferred← citeshttps://doi.org/10.70675/80532047zb663z4e63z99ecz490380944f19openalex-snapshot
Worst-case analysis of efficient first-order methods
inferred← citeshttps://doi.org/10.70675/8fe20022ze51fz40dcza63ez2d79c12a2d99openalex-snapshot
The convexity based approach to optimal control of some classes of non-standard dynamic systems
inferred← citeshttps://doi.org/10.70675/f52c672bzc908z47c6zb6a9z6c076b72425bopenalex-snapshot
Comportement asymptotique de systèmes dynamiques discrets et continus en Optimisation et EDP : algorithmes de minimisation proximale alternée et dynamique du deuxieme ordre à dissipation évanescente.
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.