On the public citation graph
Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
0 signed · 73 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-48320-2openalex-snapshot
Test Examples for Nonlinear Programming Codes
inferredcites →https://doi.org/10.1007/978-3-642-61582-5openalex-snapshot
More Test Examples for Nonlinear Programming Codes
inferredcites →https://doi.org/10.1007/978-3-642-82450-0_12openalex-snapshot
Nondifferentiable Optimization
inferredcites →https://doi.org/10.1007/bf00939042openalex-snapshot
Penalty-proximal methods in convex programming
inferredcites →https://doi.org/10.1007/bf01397543openalex-snapshot
A constraint linearization method for nondifferentiable convex minimization
inferredcites →https://doi.org/10.1007/bf01580582openalex-snapshot
A method of linearizations for linearly constrained nonconvex nonsmooth minimization
inferredcites →https://doi.org/10.1007/bf01585731openalex-snapshot
Proximity control in bundle methods for convex nondifferentiable minimization
inferredcites →https://doi.org/10.1007/bf01609012openalex-snapshot
A subgradient algorithm for certain minimax and minisum problems
inferredcites →https://doi.org/10.1007/bfb0074500openalex-snapshot
Methods of Descent for Nondifferentiable Optimization
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/c2013-0-10366-2openalex-snapshot
Constrained Optimization and Lagrange Multiplier Methods
inferredcites →https://doi.org/10.1016/s0304-0208(08)72400-9openalex-snapshot
Constructing Bundle Methods for Convex Optimization
inferredcites →https://doi.org/10.1093/imanum/5.1.111openalex-snapshot
An Exact Penalty Function Algorithm for Non-smooth Convex Constrained Minimization Problems
inferredcites →https://doi.org/10.1137/0320034openalex-snapshot
A Subgradient Algorithm for Certain Minimax and Minisum Problems—The Constrained Case
inferredcites →https://doi.org/10.1137/0321010openalex-snapshot
On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable Problems
inferredcites →https://doi.org/10.1137/0323003openalex-snapshot
Sufficiency of Exact Penalty Minimization
inferredcites →https://doi.org/10.1137/0907010openalex-snapshot
Solution of Systems of Complex Linear Equations in the $l_\infty $ Norm with Constraints on the Unknowns
inferredcites →https://doi.org/10.1137/0910013openalex-snapshot
A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems
inferredcites →https://doi.org/10.1137/1.9781611971309openalex-snapshot
Optimization and Nonsmooth Analysis
inferredcites →https://doi.org/10.2307/2008459openalex-snapshot
Mathematical Programming: Recent Developments and Applications.
inferredcites →https://doi.org/10.2307/j.ctvcm4hcj.10openalex-snapshot
Nondifferentiable Optimization
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-4684-9256-9_3openalex-snapshot
Power Management in a Hydro-Thermal System under Uncertainty by Lagrangian Relaxation
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-662-04331-8_32openalex-snapshot
Online Scheduling of Multiproduct Batch Plants under Uncertainty
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/bf02191984openalex-snapshot
Approximations in proximal bundle methods and decomposition of convex programs
inferred← citeshttps://doi.org/10.1007/bfb0008364openalex-snapshot
An algorithm for large-scale linearly constrained nondifferentiable convex minimization
inferred← citeshttps://doi.org/10.1007/s002110050065openalex-snapshot
A Cholesky dual method for proximal piecewise linear programming
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-007-0187-4openalex-snapshot
An inexact bundle variant suited to column generation
inferred← citeshttps://doi.org/10.1007/s10255-018-0755-9openalex-snapshot
A Feasible Point Method with Bundle Modification for Nonsmooth Convex Constrained 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/s10589-020-00170-6openalex-snapshot
A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods
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-011-9936-xopenalex-snapshot
Coupling the Gradient Method with a General Exterior Penalization Scheme for Convex Minimization
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/s11075-016-0208-6openalex-snapshot
An adaptive competitive penalty method for nonsmooth constrained optimization
inferred← citeshttps://doi.org/10.1007/s11075-018-0490-6openalex-snapshot
An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems
inferred← citeshttps://doi.org/10.1007/s11228-016-0365-8openalex-snapshot
A Fast Space-decomposition Scheme for Nonconvex Eigenvalue Optimization
inferred← citeshttps://doi.org/10.1007/s11590-021-01835-9openalex-snapshot
A new restricted memory level bundle method for constrained convex nonsmooth optimization
inferred← citeshttps://doi.org/10.1016/j.amc.2006.05.132openalex-snapshot
A variable metric method for nonsmooth convex constrained optimization
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.amc.2008.11.019openalex-snapshot
A filter-variable-metric method for nonsmooth convex constrained optimization
inferred← citeshttps://doi.org/10.1016/j.amc.2015.05.119openalex-snapshot
Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization
inferred← citeshttps://doi.org/10.1016/j.cam.2022.114949openalex-snapshot
A proximal bundle method-based algorithm with penalty strategy and inexact oracles for constrained nonsmooth nonconvex optimization
inferred← citeshttps://doi.org/10.1016/j.camwa.2013.05.018openalex-snapshot
A quasisecant method for solving a system of nonsmooth equations
inferred← citeshttps://doi.org/10.1016/j.cnsns.2026.110909openalex-snapshot
A New Penalty Strategy in Inexact Bundle Scheme for Constrained Convex Optimization
inferred← citeshttps://doi.org/10.1016/j.ejor.2011.10.055openalex-snapshot
Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions
inferred← citeshttps://doi.org/10.1016/j.neunet.2023.08.047openalex-snapshot
A varying-parameter fixed-time gradient-based dynamic network for convex optimization
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)52088-1openalex-snapshot
Approximations in Decomposition of Large-Scale Convex Programs via a Nondifferentiable Optimization Method
inferred← citeshttps://doi.org/10.1016/s1570-8659(02)11003-9openalex-snapshot
Linear Programming and Condition Numbers under the Real Number Computation Model
inferred← citeshttps://doi.org/10.1080/02331934.2016.1147037openalex-snapshot
An implementation of a reduced subgradient method via Luenberger-Mokhtar variant
inferred← citeshttps://doi.org/10.1080/02331934.2016.1193863openalex-snapshot
Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming
inferred← citeshttps://doi.org/10.1080/02331934.2018.1434173openalex-snapshot
Outer-approximation algorithms for nonsmooth convex MINLP problems
inferred← citeshttps://doi.org/10.1080/10556780290027828openalex-snapshot
Survey of Bundle Methods for Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1080/10556780701645057openalex-snapshot
An interior-point trust-region polynomial algorithm for convex quadratic minimization subject to general convex constraints
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/060668559openalex-snapshot
A Method of Centers with Approximate Subgradient Linearizations for Nonsmooth Convex Optimization
inferred← citeshttps://doi.org/10.1137/090780201openalex-snapshot
A Sequential Quadratic Programming Algorithm for Nonconvex, Nonsmooth Constrained Optimization
inferred← citeshttps://doi.org/10.1137/18m1228608openalex-snapshot
A New Sequential Optimality Condition for Constrained Nonsmooth Optimization
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.1142/s0217595919500155openalex-snapshot
Nonsmooth Optimization Method for H∞ Output Feedback Control
inferred← citeshttps://doi.org/10.1142/s0217595921500159openalex-snapshot
A Proximal Bundle Method with Exact Penalty Technique and Bundle Modification Strategy for Nonconvex Nonsmooth Constrained Optimization
inferred← citeshttps://doi.org/10.1155/2015/215310openalex-snapshot
An Approximate Redistributed Proximal Bundle Method with Inexact Data for Minimizing Nonsmooth Nonconvex Functions
inferred← citeshttps://doi.org/10.1155/2024/5720769openalex-snapshot
A Nonconvex Proximal Bundle Method for Nonsmooth Constrained Optimization
inferred← citeshttps://doi.org/10.1287/opre.44.4.596openalex-snapshot
Optimal Dimensioning of Pipe Networks with Application to Gas Transmission Networks
inferred← citeshttps://doi.org/10.1360/n012015-00022openalex-snapshot
A feasible descent bundle method for inequality constrained Minimax problems
inferred← citeshttps://doi.org/10.1590/0101-7438.2014.034.03.0647openalex-snapshot
BUNDLE METHODS IN THE XXIst CENTURY: A BIRD'S-EYE VIEW
inferred← citeshttps://doi.org/10.7282/t3-yp0f-td58openalex-snapshot
Risk-averse decision making and bilevel stochastic programming with applications
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.