On the public citation graph

A minimization method for the sum of a convex function and a continuously differentiable function

https://doi.org/10.1007/bf00935173
0 signed · 86 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/nav.3800030109openalex-snapshot
An algorithm for quadratic programming
inferredcites →https://doi.org/10.1007/bf01584320openalex-snapshot
Optimization of lipschitz continuous functions
inferredcites →https://doi.org/10.1007/bf01584647openalex-snapshot
Exact penalty functions in nonlinear programming
inferredcites →https://doi.org/10.1007/bf01681332openalex-snapshot
Necessary and sufficient conditions for a penalty method to be exact
inferredcites →https://doi.org/10.1007/bf02341816openalex-snapshot
Utilization of the operation of space dilatation in the 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.1016/0041-5553(66)90114-5openalex-snapshot
Constrained minimization methods
inferredcites →https://doi.org/10.1016/0041-5553(69)90061-5openalex-snapshot
Minimization of unsmooth functionals
inferredcites →https://doi.org/10.1090/s0002-9947-1975-0367131-6openalex-snapshot
Generalized Gradients and Applications
inferredcites →https://doi.org/10.1109/tac.1974.1100535openalex-snapshot
Introduction to linear and nonlinear programming
inferredcites →https://doi.org/10.1137/0311029openalex-snapshot
New Conditions for Exactness of a Simple Penalty Function
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/0315061openalex-snapshot
Semismooth and Semiconvex Functions in Constrained Optimization
inferredcites →https://doi.org/10.1137/0706028openalex-snapshot
An Exact Potential Method for Constrained Maxima
inferredcites →https://doi.org/10.1137/0710063openalex-snapshot
Constrained Optimization Using a Nondifferentiable Penalty Function
inferredcites →https://doi.org/10.1287/mnsc.13.5.344openalex-snapshot
Non-Linear Programming Via Penalty Functions
inferredcites →https://doi.org/10.1287/moor.1.2.165openalex-snapshot
A New Approach to Lagrange Multipliers
inferredcites →https://doi.org/10.1287/moor.2.2.191openalex-snapshot
An Algorithm for Constrained Optimization with Semismooth Functions
inferredcites →https://doi.org/10.1515/9781400873173openalex-snapshot
Convex Analysis
inferredcites →https://doi.org/10.2307/1909424openalex-snapshot
Nonlinear Programming: A Unified Approach
inferredcites →https://doi.org/10.2307/2005191openalex-snapshot
Necessary Conditions for an Extremum
inferredcites →https://doi.org/10.2307/2343701openalex-snapshot
Nonlinear Programming: A Unified Approach.

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-3-030-87809-2_15openalex-snapshot
Hybrid Methods for Network Equilibrium Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-18161-5_14openalex-snapshot
Composite Convex Minimization Involving Self-concordant-Like Cost Functions
inferred← citeshttps://doi.org/10.1007/978-3-319-44914-2_33openalex-snapshot
Partial Linearization Method for Network Equilibrium Problems with Elastic Demands
inferred← citeshttps://doi.org/10.1007/978-3-319-96247-4_10openalex-snapshot
Application of Market Models to Network Equilibrium Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-97142-1_3openalex-snapshot
Parallel and Distributed Successive Convex Approximation Methods for Big-Data Optimization
inferred← citeshttps://doi.org/10.1007/bf00429749openalex-snapshot
A parallel descent algorithm for convex programming
inferred← citeshttps://doi.org/10.1007/bf00939668openalex-snapshot
Partial linearization methods in nonlinear programming
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/bf01588789openalex-snapshot
A successive quadratic programming method for a class of constrained nonsmooth optimization problems
inferred← citeshttps://doi.org/10.1007/s10107-007-0170-0openalex-snapshot
A coordinate gradient descent method for nonsmooth separable minimization
inferred← citeshttps://doi.org/10.1007/s10107-010-0394-2openalex-snapshot
Approximation accuracy, gradient methods, and error bound for structured convex optimization
inferred← citeshttps://doi.org/10.1007/s10107-017-1180-1openalex-snapshot
Accelerating the DC algorithm for smooth functions
inferred← citeshttps://doi.org/10.1007/s10589-020-00202-1openalex-snapshot
Make $$\ell _1$$ regularization effective in training sparse CNN
inferred← citeshttps://doi.org/10.1007/s10589-020-00226-7openalex-snapshot
A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem
inferred← citeshttps://doi.org/10.1007/s10957-008-9458-3openalex-snapshot
Block-Coordinate Gradient Descent Method for Linearly Constrained Nonsmooth Separable Optimization
inferred← citeshttps://doi.org/10.1007/s10957-017-1175-3openalex-snapshot
An Adaptive Partial Linearization Method for Optimization Problems on Product Sets
inferred← citeshttps://doi.org/10.1007/s11075-017-0398-6openalex-snapshot
l 1-l 2 regularization of split feasibility problems
inferred← citeshttps://doi.org/10.1007/s11081-011-9154-2openalex-snapshot
Combined methods for dynamic spatial auction market models
inferred← citeshttps://doi.org/10.1007/s11228-022-00656-xopenalex-snapshot
The Boosted DC Algorithm for Linearly Constrained DC Programming
inferred← citeshttps://doi.org/10.1007/s11590-026-02327-4openalex-snapshot
Iteration complexity of the difference-of-convex algorithm for unconstrained optimization: a simple proof
inferred← citeshttps://doi.org/10.1007/s40305-025-00584-1openalex-snapshot
An Inexact Preconditioned Zeroth-Order Proximal Method for Composite Optimization
inferred← citeshttps://doi.org/10.1016/j.amc.2005.05.044openalex-snapshot
A proximal-point SQP trust region method for solving some special class of nonlinear semi-definite programming problems
inferred← citeshttps://doi.org/10.1017/s096249291600009xopenalex-snapshot
An introduction to continuous optimization for imaging
inferred← citeshttps://doi.org/10.1023/a:1008321729949openalex-snapshot
On Optimization Properties of Functions, with a Concave Minorant
inferred← citeshttps://doi.org/10.1080/00207728108963798openalex-snapshot
A generalized proximal point algorithm for certain non-convex minimization problems
inferred← citeshttps://doi.org/10.1080/01630563.2022.2109171openalex-snapshot
A New Boosted Proximal Point Algorithm for Minimizing Nonsmooth DC Functions
inferred← citeshttps://doi.org/10.1080/01630568208816109openalex-snapshot
Submonotone mappings and the proximal point algorithm
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.2018.1471141openalex-snapshot
Stochastic proximal quasi-Newton methods for non-convex composite optimization
inferred← citeshttps://doi.org/10.1080/10556788.2020.1746963openalex-snapshot
Asynchronous variance-reduced block schemes for composite non-convex stochastic optimization: block-specific steplengths and adapted batch-sizes
inferred← citeshttps://doi.org/10.1109/cdc.1983.269656openalex-snapshot
Convergence rates of Quasi-Newton algorithms for some non-smooth optimization problems
inferred← citeshttps://doi.org/10.1109/icra.2019.8794261openalex-snapshot
Sensor Coverage Control Using Robots Constrained to a Curve
inferred← citeshttps://doi.org/10.1109/lcsys.2020.3046377openalex-snapshot
Proximity Moving Horizon Estimation for Discrete-Time Nonlinear Systems
inferred← citeshttps://doi.org/10.1109/tnnls.2015.2418224openalex-snapshot
DC Proximal Newton for Nonconvex Optimization Problems
inferred← citeshttps://doi.org/10.1109/tsp.2015.2399858openalex-snapshot
Parallel Selective Algorithms for Nonconvex Big Data Optimization
inferred← citeshttps://doi.org/10.1109/tsp.2019.2959240openalex-snapshot
Inexact Block Coordinate Descent Algorithms for Nonsmooth Nonconvex Optimization
inferred← citeshttps://doi.org/10.1134/s199047892001010xopenalex-snapshot
Inexact Partial Linearization Methods for Network Equilibrium Problems
inferred← citeshttps://doi.org/10.1137/0323026openalex-snapshot
Convergence Rates of Quasi-Newton Algorithms for Some Nonsmooth Optimization Problems
inferred← citeshttps://doi.org/10.1137/100790197openalex-snapshot
Dithering by Differences of Convex Functions
inferred← citeshttps://doi.org/10.1137/18m123339xopenalex-snapshot
The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
inferred← citeshttps://doi.org/10.1137/21m1421660openalex-snapshot
Efficient Boosted DC Algorithm for Nonconvex Image Restoration with Rician Noise
inferred← citeshttps://doi.org/10.1137/21m1465263openalex-snapshot
Affine Invariant Convergence Rates of the Conditional Gradient Method
inferred← citeshttps://doi.org/10.1137/s105262349427577xopenalex-snapshot
Cost Approximation: A Unified Framework of Descent Algorithms for Nonlinear Programs
inferred← citeshttps://doi.org/10.1186/s13660-018-1683-1openalex-snapshot
An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems
inferred← citeshttps://doi.org/10.1609/aaai.v33i01.33011503openalex-snapshot
Faster Gradient-Free Proximal Stochastic Methods for Nonconvex Nonsmooth Optimization
inferred← citeshttps://doi.org/10.23919/acc50511.2021.9483410openalex-snapshot
Proximity Moving Horizon Estimation for Discrete-Time Nonlinear Systems
inferred← citeshttps://doi.org/10.33048/daio.2020.27.658openalex-snapshot
Inexact partial linearization methods for network equilibrium problems
inferred← citeshttps://doi.org/10.33965/ac2019_201912l023openalex-snapshot
PARTIAL LINEARIZATION WITHOUT LINESEARCH FOR NETWORK EQUILIBRIUM PROBLEMS
inferred← citeshttps://doi.org/10.3934/ipi.2015.9.815openalex-snapshot
Nomonotone spectral gradient method for sparse recovery
inferred← citeshttps://doi.org/10.3934/math.2026194openalex-snapshot
A new mini-batch negative momentum proximal stochastic variance reduction method for nonconvex optimization
inferred← citeshttps://doi.org/10.3934/naco.2011.1.1iopenalex-snapshot
Preface
inferred← citeshttps://doi.org/10.4208/nmtma.2009.m9002sopenalex-snapshot
A Coordinate Gradient Descent Method for Nonsmooth Nonseparable Minimization
inferred← citeshttps://doi.org/10.48550/arxiv.1105.0276openalex-snapshot
Proximal methods for minimizing the sum of a convex function and a composite function
inferred← citeshttps://doi.org/10.48550/arxiv.1105.2632openalex-snapshot
A splitting proximal point method for Nash-Cournot equilibrium models involving nonconvex cost functions
inferred← citeshttps://doi.org/10.48550/arxiv.1308.2867openalex-snapshot
Composite Self-Concordant Minimization
inferred← citeshttps://doi.org/10.48550/arxiv.1410.4828openalex-snapshot
Generalized Conditional Gradient for Sparse Estimation
inferred← citeshttps://doi.org/10.48550/arxiv.1508.03899openalex-snapshot
Convergence analysis of a proximal-type algorithm for DC programs with applications to variable selection
inferred← citeshttps://doi.org/10.48550/arxiv.1812.06070openalex-snapshot
The Boosted DC Algorithm for nonsmooth functions
inferred← citeshttps://doi.org/10.48550/arxiv.2104.09685openalex-snapshot
Accelerated Inexact First-Order Methods for Solving Nonconvex Composite Optimization Problems
inferred← citeshttps://doi.org/10.5555/3540261.3540373openalex-snapshot
Regularized Frank-Wolfe for Dense CRFs: Generalizing Mean Field and Beyond
inferred← citeshttps://doi.org/10.56028/aetr.9.1.497.2024openalex-snapshot
Solving a Class of Nonsmooth Nonconvex Optimization Problems Via Proximal Alternating Linearization Scheme with Inexact Information
inferred← citeshttps://doi.org/10.5802/ojmo.21openalex-snapshot
Short Paper - A note on the Frank–Wolfe algorithm for a class of nonconvex and nonsmooth optimization problems
inferred← citeshttps://doi.org/10.70675/453bb1e6z3cfcz41a6zb749z89e08780dc09openalex-snapshot
Operational planning under joint uncertainties
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.