On the public citation graph

A successive quadratic programming method for a class of constrained nonsmooth optimization problems

https://doi.org/10.1007/bf01588789
0 signed · 41 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/9781118723203openalex-snapshot
Practical Methods of Optimization
inferredcites →https://doi.org/10.1007/978-3-642-68874-4_12openalex-snapshot
Variable Metric Methods for Constrained Optimization
inferredcites →https://doi.org/10.1007/bf00935173openalex-snapshot
A minimization method for the sum of a convex function and a continuously differentiable function
inferredcites →https://doi.org/10.1007/bf00940570openalex-snapshot
A method for minimizing the sum of a convex function and a continuously differentiable function
inferredcites →https://doi.org/10.1007/bf00940574openalex-snapshot
An algorithm for composite nonsmooth optimization problems
inferredcites →https://doi.org/10.1007/bf01390337openalex-snapshot
Strong uniqueness
inferredcites →https://doi.org/10.1007/bf01397543openalex-snapshot
A constraint linearization method for nondifferentiable convex minimization
inferredcites →https://doi.org/10.1007/bf01448379openalex-snapshot
Some remarks on the construction of higher order algorithms in convex optimization
inferredcites →https://doi.org/10.1007/bf01585659openalex-snapshot
Local properties of algorithms for minimizing nonsmooth composite functions
inferredcites →https://doi.org/10.1007/bf02591883openalex-snapshot
A descent algorithm for nonsmooth convex optimization
inferredcites →https://doi.org/10.1007/bf02592055openalex-snapshot
Truncated-Newton algorithms for large-scale unconstrained optimization
inferredcites →https://doi.org/10.1007/bf02594782openalex-snapshot
ε-Optimal solutions in nondifferentiable convex programming and some related questions
inferredcites →https://doi.org/10.1007/bfb0120957openalex-snapshot
Optimality conditions for piecewise smooth functions
inferredcites →https://doi.org/10.1007/bfb0121157openalex-snapshot
Numerical methods for nondifferentiable convex optimization
inferredcites →https://doi.org/10.1016/b978-0-12-468660-1.50021-9openalex-snapshot
MINIMISATION DE FONCTIONS LOCALEMENT LIPSCHITZIENNES: APPLICATIONS A LA PROGRAMMATION MI-CONVEXE, MI-DIFFERENTIABLE
inferredcites →https://doi.org/10.1016/c2013-0-10366-2openalex-snapshot
Constrained Optimization and Lagrange Multiplier Methods
inferredcites →https://doi.org/10.1057/jors.1981.14openalex-snapshot
Mathematical Programming: Structures and Algorithms
inferredcites →https://doi.org/10.1057/jors.1982.148openalex-snapshot
Practical Methods of Optimization. Vol. 2 -- Constrained Optimization
inferredcites →https://doi.org/10.1080/00207728108963798openalex-snapshot
A generalized proximal point algorithm for certain non-convex minimization problems
inferredcites →https://doi.org/10.1080/01630568208816109openalex-snapshot
Submonotone mappings and the proximal point algorithm
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/0314056openalex-snapshot
Monotone Operators and the Proximal Point Algorithm
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/0322025openalex-snapshot
Calculus Rules on the Approximate Second-Order Directional Derivative of a Convex Function
inferredcites →https://doi.org/10.1137/0910036openalex-snapshot
An Efficient Trust Region Algorithm for Minimizing Nondifferentiable Composite Functions
inferredcites →https://doi.org/10.1137/1.9781611971309openalex-snapshot
Optimization and Nonsmooth Analysis
inferredcites →https://doi.org/10.1515/9781400873173openalex-snapshot
Convex Analysis

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/bf00939668openalex-snapshot
Partial linearization methods in nonlinear programming
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/s10957-008-9458-3openalex-snapshot
Block-Coordinate Gradient Descent Method for Linearly Constrained Nonsmooth Separable 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.1088/1742-6596/1255/1/012090openalex-snapshot
A Generalized Reduced Gradient Approach for Solving a Class of Two-Stage Stochastic Nonlinear Programs
inferred← citeshttps://doi.org/10.1137/090780201openalex-snapshot
A Sequential Quadratic Programming Algorithm for Nonconvex, Nonsmooth Constrained Optimization
inferred← citeshttps://doi.org/10.1137/24m1653586openalex-snapshot
A Proximal-Gradient Method for Equality Constrained Optimization
inferred← citeshttps://doi.org/10.1137/s1052623402361447openalex-snapshot
A Decomposition Method Based on SQP for a Class of Multistage Stochastic Nonlinear Programs
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.36.1openalex-snapshot
A PRACTICAL APPROACH TO DECOMPOSABLE NONLINEAR PROGRAMMING 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/naco.2011.1.1iopenalex-snapshot
Preface
inferred← citeshttps://doi.org/10.4208/aam.v34.n2.p138openalex-snapshot
A Block-Coordinate Descent Method for Linearly Constrained Minimization Problem
inferred← citeshttps://doi.org/10.4208/nmtma.2009.m9002sopenalex-snapshot
A Coordinate Gradient Descent Method for Nonsmooth Nonseparable Minimization
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.