On the public citation graph
A quasi-second-order proximal bundle algorithm
0 signed · 110 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-3-642-82450-0_12openalex-snapshot
Nondifferentiable Optimization
inferredcites →https://doi.org/10.1007/978-3-662-02796-7openalex-snapshot
Convex analysis and minimization algorithms
inferredcites →https://doi.org/10.1007/978-3-662-06409-2openalex-snapshot
Convex Analysis and Minimization Algorithms II
inferredcites →https://doi.org/10.1007/bf00940782openalex-snapshot
Variational quasi-Newton methods for unconstrained optimization
inferredcites →https://doi.org/10.1007/bf01386389openalex-snapshot
Newton's method for convex programming and Tchebycheff approximation
inferredcites →https://doi.org/10.1007/bf01581275openalex-snapshot
A nonsmooth version of Newton's method
inferredcites →https://doi.org/10.1007/bf01581698openalex-snapshot
The least prior deviation quasi-Newton update
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/bf01585170openalex-snapshot
Convergence of some algorithms for convex minimization
inferredcites →https://doi.org/10.1007/bf01585731openalex-snapshot
Proximity control in bundle methods for convex nondifferentiable minimization
inferredcites →https://doi.org/10.1007/bf01585756openalex-snapshot
A family of variable metric proximal methods
inferredcites →https://doi.org/10.1007/bf01586091openalex-snapshot
Applications of the method of partial inverses to convex programming: Decomposition
inferredcites →https://doi.org/10.1007/bf01588792openalex-snapshot
On superlinear convergence in univariate nonsmooth minimization
inferredcites →https://doi.org/10.1007/bf01594934openalex-snapshot
Convergence of quasi-Newton matrices generated by the symmetric rank one update
inferredcites →https://doi.org/10.1007/bf02023102openalex-snapshot
Resolving degeneracy in quadratic programming
inferredcites →https://doi.org/10.1007/bf02591883openalex-snapshot
A descent algorithm for nonsmooth convex optimization
inferredcites →https://doi.org/10.1007/bf02612712openalex-snapshot
Stationarity and superlinear convergence of an algorithm for univariate locally lipschitz constrained minimization
inferredcites →https://doi.org/10.1007/bfb0008905openalex-snapshot
Better than linear convergence and safeguarding in nonsmooth minimization
inferredcites →https://doi.org/10.1007/bfb0035464openalex-snapshot
An approach to variable metric bundle methods
inferredcites →https://doi.org/10.1007/bfb0074500openalex-snapshot
Methods of Descent for Nondifferentiable Optimization
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/bfb0121157openalex-snapshot
Numerical methods for nondifferentiable convex optimization
inferredcites →https://doi.org/10.1016/b978-1-898563-21-1.50008-0openalex-snapshot
Mathematical Programming
inferredcites →https://doi.org/10.1016/s0927-0507(89)01008-xopenalex-snapshot
Chapter VII Nondifferentiable optimization
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.1137/0108053openalex-snapshot
The Cutting-Plane Method for Solving Convex Programs
inferredcites →https://doi.org/10.1137/0314056openalex-snapshot
Monotone Operators and the Proximal Point Algorithm
inferredcites →https://doi.org/10.1137/0802008openalex-snapshot
A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
inferredcites →https://doi.org/10.1137/0803001openalex-snapshot
A Theoretical and Experimental Study of the Symmetric Rank-One Update
inferredcites →https://doi.org/10.1137/1019005openalex-snapshot
Quasi-Newton Methods, Motivation and Theory
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.2307/j.ctvcm4hcj.10openalex-snapshot
Nondifferentiable Optimization
inferredcites →https://doi.org/10.24033/bsmf.1625openalex-snapshot
Proximité et dualité dans un espace hilbertien
inferredcites →https://doi.org/10.4324/9781003580447-17openalex-snapshot
Lagrangian Decomposition and Nonsmooth Optimization: Bundle Algorithm, Prox Iteration, Augmented Lagrangian
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-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-4614-7621-4_26openalex-snapshot
Bundle Method for Non-Convex Minimization with Inexact Subgradients and Function Values
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-6388-1_16openalex-snapshot
On the Local Super-Linear Convergence of a Matrix Secant Implementation of the Variable Metric Proximal Point Algorithm for Monotone Operators
inferred← citeshttps://doi.org/10.1007/978-1-4899-0289-4_14openalex-snapshot
Semismoothness and Superlinear Convergence in Nonsmooth Optimization and Nonsmooth Equations
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_9openalex-snapshot
Beyond First Order: V U $$\mathcal {V}\mathcal {U}$$ -Decomposition Methods
inferred← citeshttps://doi.org/10.1007/978-3-030-48439-2_12openalex-snapshot
Toward Global Search for Local Optima
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-45767-8_2openalex-snapshot
Optimal Power Generation under Uncertainty via Stochastic Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-45780-7_11openalex-snapshot
VU-Decomposition Derivatives for Convex Max-Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-45780-7_8openalex-snapshot
Stable Solution of Variational Inequalities with Composed Monotone Operators
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/bf01585756openalex-snapshot
A family of variable metric proximal methods
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/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-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/s10107980029aopenalex-snapshot
Properties of the Moreau-Yosida regularization of a piecewise C2 convex function
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/s10898-017-0565-2openalex-snapshot
A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
inferred← citeshttps://doi.org/10.1007/s10957-024-02378-6openalex-snapshot
Role of Subgradients in Variational Analysis of Polyhedral Functions
inferred← citeshttps://doi.org/10.1007/s11075-006-9056-0openalex-snapshot
Fast Moreau envelope computation I: numerical algorithms
inferred← citeshttps://doi.org/10.1007/s11075-015-0034-2openalex-snapshot
Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization
inferred← citeshttps://doi.org/10.1007/s11081-021-09705-0openalex-snapshot
Minimizing oracle-structured composite functions
inferred← citeshttps://doi.org/10.1007/s11081-023-09859-zopenalex-snapshot
Implementation of an oracle-structured bundle method for distributed 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.1007/s40305-021-00352-xopenalex-snapshot
The Developments of Proximal Point Algorithms
inferred← citeshttps://doi.org/10.1016/j.cam.2013.08.010openalex-snapshot
Aggregate codifferential method for nonsmooth DC optimization
inferred← citeshttps://doi.org/10.1016/j.ejor.2006.04.005openalex-snapshot
A bundle modification strategy for convex minimization
inferred← citeshttps://doi.org/10.1016/s0739-8859(05)13005-4openalex-snapshot
Network Competition in Air Transportation Markets: Bi-Level Approach
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:1011259017643openalex-snapshot
A Proximal Bundle Method Based on Approximate Subgradients
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.1023/a:1023227716953openalex-snapshot
Continuous Subdifferential Approximations and Their Applications
inferred← citeshttps://doi.org/10.1023/b:jota.0000005046.70410.02openalex-snapshot
On Approximations with Finite Precision in Bundle Methods for Nonsmooth Optimization
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/02331934.2010.522713openalex-snapshot
First-order and second-order optimality conditions for nonsmooth constrained problems via convolution smoothing
inferred← citeshttps://doi.org/10.1080/10556780290027828openalex-snapshot
Survey of Bundle Methods for Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1080/10556780290027837openalex-snapshot
A Method for Minimization of Quasidifferentiable 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.1080/10556780802264071openalex-snapshot
Non-smoothness in classification problems
inferred← citeshttps://doi.org/10.1080/10556780903151565openalex-snapshot
A quasisecant method for minimizing nonsmooth functions
inferred← citeshttps://doi.org/10.1080/10556780903157869openalex-snapshot
Second-order analysis of the Moreau–Yosida and the Lasry–Lions regularizations
inferred← citeshttps://doi.org/10.1111/j.1468-0106.2010.00535.xopenalex-snapshot
EVALUATION OF ASIAN AIRPORTS AS GATEWAYS: APPLICATION OF NETWORK EQUILIBRIUM MODEL
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/080719613openalex-snapshot
What Shape Is Your Conjugate? A Survey of Computational Convex Analysis and Its Applications
inferred← citeshttps://doi.org/10.1137/080729864openalex-snapshot
Identifying Structure of Nonsmooth Convex Functions by the Bundle Technique
inferred← citeshttps://doi.org/10.1137/17m1125157openalex-snapshot
An Inexact Variable Metric Proximal Point Algorithm for Generic Quasi-Newton Acceleration
inferred← citeshttps://doi.org/10.1137/s0363012992235547openalex-snapshot
A Variable Metric Proximal Point Algorithm for Monotone Operators
inferred← citeshttps://doi.org/10.1137/s0363012998333116openalex-snapshot
Proximal Point Approach and Approximation of Variational Inequalities
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.1155/2013/697474openalex-snapshot
An Approximate Quasi-Newton Bundle-Type Method for Nonsmooth Optimization
inferred← citeshttps://doi.org/10.18452/2842openalex-snapshot
Volumetric center method for stochastic convex programs using sampling
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.2208/journalip.22.609openalex-snapshot
Model of Air Transport Market Concerning Low Cost Carrier's Behavior
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.4236/ajcm.2020.101001openalex-snapshot
A Scaled Conjugate Gradient Method Based on New BFGS Secant Equation with Modified Nonmonotone 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/jca06005openalex-snapshot
A Hybrid Projection-Proximal Point Algorithm
inferred← citeshttps://doi.org/10.68381/jca09033openalex-snapshot
Proximal Points are on the Fast Track
inferred← citeshttps://doi.org/10.68381/jca12005openalex-snapshot
Relating U-Lagrangians to Second-Order Epi-Derivatives and Proximal Tracks
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.