On the public citation graph
Nondifferentiable optimization via approximation
0 signed · 137 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/bf00934777openalex-snapshot
The multiplier method of Hestenes and Powell applied to convex programming
inferredcites →https://doi.org/10.1007/bf01580223openalex-snapshot
Validation of subgradient optimization
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(69)90061-5openalex-snapshot
Minimization of unsmooth functionals
inferredcites →https://doi.org/10.1016/b978-0-12-468650-2.50010-9openalex-snapshot
ON PENALTY AND MULTIPLIER METHODS FOR CONSTRAINED MINIMIZATION**This work was supported by the Joint Services Electronics Program (U.S. Army, U.S. Navy, U.S. Air Force) under Contract DAAB-07-72-C-0259.
inferredcites →https://doi.org/10.1093/comjnl/12.3.207-aopenalex-snapshot
Nonlinear Programming--Sequential Unconstrained Minimization Techniques
inferredcites →https://doi.org/10.1109/cdc.1973.269203openalex-snapshot
Multiplier methods for convex programming
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/0313030openalex-snapshot
Combined Primal-Dual and Penalty Methods for Constrained Minimization
inferredcites →https://doi.org/10.1137/0314020openalex-snapshot
Combined Primal–Dual and Penalty Methods for Convex Programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4882742openalex-extracted
Identifying the General Equilibrium Effects of Narcotics Enforcement
inferred← citeshttps://doi.org/10.2139/ssrn.4890671openalex-extracted
Identifying the General Equilibrium Effects of Narcotics Enforcement
inferred← citeshttps://doi.org/10.1002/nme.5819openalex-snapshot
A continuation method for rigid‐cohesive fracture in a discontinuous Galerkin finite element setting
inferred← citeshttps://doi.org/10.1007/978-1-4614-8615-2_5openalex-snapshot
On the Regularization Method in Nondifferentiable Optimization Applied to Hemivariational Inequalities
inferred← citeshttps://doi.org/10.1007/978-1-4757-5284-7_13openalex-snapshot
A Nonlinear Lagrangian Function for Discrete Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-1-4939-0808-0_20openalex-snapshot
On the Discretization of Pseudomonotone Variational Inequalities with an Application to the Numerical Solution of the Nonmonotone Delamination Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-12416-7_14openalex-snapshot
A New Smoothing Approach for Piecewise Smooth Functions: Application to Some Fundamental Functions
inferred← citeshttps://doi.org/10.1007/978-3-319-51317-1_8openalex-snapshot
Direct Methods for Optimal Control
inferred← citeshttps://doi.org/10.1007/978-3-319-93188-3_14openalex-snapshot
Optimal Object Placement Using a Virtual Axis
inferred← citeshttps://doi.org/10.1007/978-3-642-22110-1_22openalex-snapshot
Smoothing a Program Soundly and Robustly
inferred← citeshttps://doi.org/10.1007/978-3-642-72557-9_107openalex-snapshot
Algorithmen zur Losung Eines Diskreten Minimax Problemes — Ein Wertender Überblick
inferred← citeshttps://doi.org/10.1007/bf00933293openalex-snapshot
Approximation procedures based on the method of multipliers
inferred← citeshttps://doi.org/10.1007/bf00933357openalex-snapshot
Algorithms for a class of nondifferentiable problems
inferred← citeshttps://doi.org/10.1007/bf00934840openalex-snapshot
Some numerical experience with a globally convergent algorithm for nonlinearly constrained optimization
inferred← citeshttps://doi.org/10.1007/bf01391417openalex-snapshot
A quadratic approximation method for minimizing a class of quasidifferentiable functions
inferred← citeshttps://doi.org/10.1007/bf01580609openalex-snapshot
A smooth method for the finite minimax problem
inferred← citeshttps://doi.org/10.1007/bf01581628openalex-snapshot
A smoothing-out technique for min—max optimization
inferred← citeshttps://doi.org/10.1007/bf01584320openalex-snapshot
Optimization of lipschitz continuous functions
inferred← citeshttps://doi.org/10.1007/bf01584321openalex-snapshot
Objective function approximations in mathematical programming
inferred← citeshttps://doi.org/10.1007/bf01588251openalex-snapshot
Acceleration of the leastpth algorithm for minimax optimization with engineering applications
inferred← citeshttps://doi.org/10.1007/bf02060937openalex-snapshot
Nondifferentiable optimization via smooth approximation: General analytical approach
inferred← citeshttps://doi.org/10.1007/bf02098175openalex-snapshot
Implicitly defined optimization problems
inferred← citeshttps://doi.org/10.1007/bf02241819openalex-snapshot
Discrete minimax problem: Algorithms and numerical comparisons
inferred← citeshttps://doi.org/10.1007/bf02591956openalex-snapshot
The complexity of anl p method for discrete Tchebycheff approximation in exact arithmetic
inferred← citeshttps://doi.org/10.1007/s00186-022-00776-yopenalex-snapshot
Solving continuous set covering problems by means of semi-infinite optimization
inferred← citeshttps://doi.org/10.1007/s10100-018-0593-0openalex-snapshot
Lagrangian relaxation of the generic materials and operations planning model
inferred← citeshttps://doi.org/10.1007/s10107-023-01931-xopenalex-snapshot
A gradient sampling algorithm for stratified maps with applications to topological data analysis
inferred← citeshttps://doi.org/10.1007/s10255-008-8828-9openalex-snapshot
Error bounds of two smoothing approximations for semi-infinite minimax problems
inferred← citeshttps://doi.org/10.1007/s10589-007-9011-6openalex-snapshot
Smoothed penalty algorithms for optimization of nonlinear models
inferred← citeshttps://doi.org/10.1007/s10589-012-9504-9openalex-snapshot
A second-order smooth penalty function algorithm for constrained optimization problems
inferred← citeshttps://doi.org/10.1007/s10589-018-0009-zopenalex-snapshot
A smooth path-following algorithm for market equilibrium under a class of piecewise-smooth concave utilities
inferred← citeshttps://doi.org/10.1007/s10589-025-00694-9openalex-snapshot
A unified approach for smoothing approximations to the exact $$\ell _1$$-penalty for inequality-constrained optimization
inferred← citeshttps://doi.org/10.1007/s10898-016-0440-6openalex-snapshot
Differentiable McCormick relaxations
inferred← citeshttps://doi.org/10.1007/s10957-008-9355-9openalex-snapshot
An Algorithm Based on Active Sets and Smoothing for Discretized Semi-Infinite Minimax Problems
inferred← citeshttps://doi.org/10.1007/s10957-014-0521-yopenalex-snapshot
A Study of Regularization Techniques of Nondifferentiable Optimization in View of Application to Hemivariational Inequalities
inferred← citeshttps://doi.org/10.1007/s10957-014-0586-7openalex-snapshot
Weiszfeld’s Method: Old and New Results
inferred← citeshttps://doi.org/10.1007/s10957-022-02093-0openalex-snapshot
Perturbed Iterate SGD for Lipschitz Continuous Loss Functions
inferred← citeshttps://doi.org/10.1007/s10957-026-02975-7openalex-snapshot
Smoothing Functions for Sparse Optimization: A Unified Framework
inferred← citeshttps://doi.org/10.1007/s11228-013-0235-6openalex-snapshot
Gradient Consistency for Integral-convolution Smoothing Functions
inferred← citeshttps://doi.org/10.1007/s11590-018-1315-1openalex-snapshot
A new global optimization technique by auxiliary function method in a directional search
inferred← citeshttps://doi.org/10.1016/0005-1098(76)90077-7openalex-snapshot
Multiplier methods: A survey
inferred← citeshttps://doi.org/10.1016/0096-3003(83)90032-2openalex-snapshot
A min-max algorithm for non-linear regression models
inferred← citeshttps://doi.org/10.1016/0377-2217(79)90228-5openalex-snapshot
A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
inferred← citeshttps://doi.org/10.1016/0377-2217(95)90601-aopenalex-snapshot
A smooth penalty function algorithm for network-structured problems
inferred← citeshttps://doi.org/10.1016/0898-1221(76)90003-1openalex-snapshot
A dual algorithm for the solution of nonlinear variational problems via finite element approximation
inferred← citeshttps://doi.org/10.1016/b978-0-12-141050-6.50014-3openalex-snapshot
OPTIMIZATION FOR SPARSE SYSTEMS
inferred← citeshttps://doi.org/10.1016/b978-0-12-468660-1.50012-8openalex-snapshot
EXACT PENALTY ALGORITHMS FOR NONLINEAR PROGRAMMING11Research supported by NSF Grants GJ 35292 and DCR 7420584 at the University of Wisconsin.
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1016/b978-0-12-468662-5.50015-xopenalex-snapshot
ON A BUNDLE ALGORITHM FOR NONSMOOTH OPTIMIZATION
inferred← citeshttps://doi.org/10.1016/j.automatica.2021.109608openalex-snapshot
Cluster-based distributed augmented Lagrangian algorithm for a class of constrained convex optimization problems
inferred← citeshttps://doi.org/10.1016/j.cam.2008.10.047openalex-snapshot
Generalized Pattern Search methods for a class of nonsmooth optimization problems with structure
inferred← citeshttps://doi.org/10.1016/j.cam.2011.02.031openalex-snapshot
A penalty function method based on smoothing lower order penalty function
inferred← citeshttps://doi.org/10.1016/j.ins.2016.11.020openalex-snapshot
Convergence analyses on sparse feedforward neural networks via group lasso regularization
inferred← citeshttps://doi.org/10.1016/j.jmacro.2026.103806openalex-snapshot
Global risk, local rules: Moral hazard and international portfolio choice
inferred← citeshttps://doi.org/10.1016/j.neucom.2017.04.046openalex-snapshot
A convergent smoothing algorithm for training max –min fuzzy neural networks
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)40600-8openalex-snapshot
Assembly Production Planning by Network Flow Approach
inferred← citeshttps://doi.org/10.1017/s0334270000000588openalex-snapshot
A comparative study of smoothing approximations
inferred← citeshttps://doi.org/10.1017/s0334270000010444openalex-snapshot
Smoothing approximations to nonsmooth optimization problems
inferred← citeshttps://doi.org/10.1023/a:1008660924636openalex-snapshot
First-Order Algorithms for Generalized Semi-Infinite Min-Max Problems
inferred← citeshttps://doi.org/10.1023/a:1014861331301openalex-snapshot
Smoothing Functions and Smoothing Newton Method for Complementarity and Variational Inequality Problems
inferred← citeshttps://doi.org/10.1023/a:1022627226891openalex-snapshot
Smooth Transformation of the Generalized Minimax Problem
inferred← citeshttps://doi.org/10.1023/a:1026028626328openalex-snapshot
Nonlinear Lagrange Duality Theorems and Penalty Function Methods In Continuous Optimization
inferred← citeshttps://doi.org/10.1049/rsn2.12059openalex-snapshot
Analysis of SPRITE : A new sparse approach for 3D high resolution RCS imaging
inferred← citeshttps://doi.org/10.1063/1.4992410openalex-snapshot
New global optimization method for non-smooth unconstrained continuous optimization
inferred← citeshttps://doi.org/10.1063/5.0095371openalex-snapshot
A smoothing approximation method for classical l1 exact penalty function for optimization problems.
inferred← citeshttps://doi.org/10.1080/00207160.2022.2163388openalex-snapshot
Smoothing techniques in solving non-Lipschitz absolute value equations
inferred← citeshttps://doi.org/10.1080/01621459.1981.10477752openalex-snapshot
A New Maximum Likelihood Algorithm for Piecewise Regression
inferred← citeshttps://doi.org/10.1080/01630563.2013.811421openalex-snapshot
Second-Order Smoothing Objective Penalty Function for Constrained Optimization Problems
inferred← citeshttps://doi.org/10.1080/01630563.2018.1561466openalex-snapshot
New Smoothing Approximations to Piecewise Smooth Functions and Applications
inferred← citeshttps://doi.org/10.1080/02331930410001662199openalex-snapshot
An exact lower order penalty function and its smoothing in nonlinear programming
inferred← citeshttps://doi.org/10.1080/02331934.2014.1001758openalex-snapshot
From solvability and approximation of variational inequalities to solution of nondifferentiable optimization problems in contact mechanics
inferred← citeshttps://doi.org/10.1080/02331938208842766openalex-snapshot
,,Ein 2-Stufen Newton-Dem’yanov Algorithmus zur Lösung eines diskreten Minimaxproblemes“
inferred← citeshttps://doi.org/10.1080/02331939908844460openalex-snapshot
Extended Lagrange And Penalty Functions in Continuous Optimization*
inferred← citeshttps://doi.org/10.1080/0740817x.2012.745205openalex-snapshot
A smooth Monte Carlo approach to joint chance-constrained programs
inferred← citeshttps://doi.org/10.1080/10556780802264071openalex-snapshot
Non-smoothness in classification problems
inferred← citeshttps://doi.org/10.1080/10556788.2025.2611436openalex-snapshot
A smoothing method for solving quadratic convex separable knapsack problems
inferred← citeshttps://doi.org/10.1080/10556788.2026.2647275openalex-snapshot
Self-concordant smoothing in proximal quasi-Newton algorithms for large-scale convex composite optimization
inferred← citeshttps://doi.org/10.1085/jgp.201711912openalex-snapshot
Estimating kinetic mechanisms with prior knowledge II: Behavioral constraints and numerical tests
inferred← citeshttps://doi.org/10.1090/conm/658/13128openalex-snapshot
Smoothing techniques for exact penalty methods
inferred← citeshttps://doi.org/10.1109/26.46514openalex-snapshot
Optimal routing in circuit switched communication networks
inferred← citeshttps://doi.org/10.1109/78.950776openalex-snapshot
Regularized estimation of mixed spectra using a circular Gibbs-Markov model
inferred← citeshttps://doi.org/10.1109/9.45158openalex-snapshot
A new problem in control system design (and circuit design)
inferred← citeshttps://doi.org/10.1109/cdc.1986.267602openalex-snapshot
Optimal routing in circuit-switched communication networks
inferred← citeshttps://doi.org/10.1109/lra.2020.3004780openalex-snapshot
Autonomous and Cooperative Design of the Monitor Positions for a Team of UAVs to Maximize the Quantity and Quality of Detected Objects
inferred← citeshttps://doi.org/10.1109/mper.1986.5527953openalex-snapshot
A Hydro-Thermal Scheduling Model for the Hydro-Qu??bec Production System
inferred← citeshttps://doi.org/10.1109/ojap.2022.3178840openalex-snapshot
Multiobjective Fitness Functions With Nonlinear Switching for Antenna Optimizations
inferred← citeshttps://doi.org/10.1109/radar41533.2019.171350openalex-snapshot
SPRITE: A New Sparse Approach for 3D High Resolution RCS Imaging
inferred← citeshttps://doi.org/10.1109/smc.2016.7844819openalex-snapshot
Non-parametric smoothing for gradient methods in non-differentiable optimization problems
inferred← citeshttps://doi.org/10.1109/tac.1983.1103136openalex-snapshot
Optimal short-term scheduling of large-scale power systems
inferred← citeshttps://doi.org/10.1109/tac.2026.3672070openalex-snapshot
A Robust Low-Complexity Control Framework for Uncertain Nonlinear Systems With Hard and Soft Output Constraints
inferred← citeshttps://doi.org/10.1109/taslp.2018.2821903openalex-snapshot
End-to-End Waveform Utterance Enhancement for Direct Evaluation Metrics Optimization by Fully Convolutional Neural Networks
inferred← citeshttps://doi.org/10.1109/tci.2020.2999162openalex-snapshot
SPRITE: 3-D SParse Radar Imaging TEchnique
inferred← citeshttps://doi.org/10.1109/tcs.1976.1084140openalex-snapshot
A new algorithm for solution of resistive networks involving diodes
inferred← citeshttps://doi.org/10.1109/tcst.2021.3111538openalex-snapshot
Coordinated Receding-Horizon Control of Battery Electric Vehicle Speed and Gearshift Using Relaxed Mixed-Integer Nonlinear Programming
inferred← citeshttps://doi.org/10.1109/tpas.1982.317243openalex-snapshot
Solution of Large-Scale Optimal Unit Commitment Problems
inferred← citeshttps://doi.org/10.1109/tpwrs.1986.4334930openalex-snapshot
A Hydro-Thermal Scheduling Model for the Hydro-Québec Production System
inferred← citeshttps://doi.org/10.11121/ijocta.01.2019.00671openalex-snapshot
A new auxiliary function approach for inequality constrained global optimization problems
inferred← citeshttps://doi.org/10.1137/0326071openalex-snapshot
Smooth Optimization Methods for Minimax Problems
inferred← citeshttps://doi.org/10.1137/0804027openalex-snapshot
On Smoothing Exact Penalty Functions for Convex Constrained Optimization
inferred← citeshttps://doi.org/10.1137/120889812openalex-snapshot
Epi-convergent Smoothing with Applications to Convex Composite Functions
inferred← citeshttps://doi.org/10.1137/s1052623499358951openalex-snapshot
Second-Order Algorithms for Generalized Finite and Semi-Infinite Min-Max Problems
inferred← citeshttps://doi.org/10.1142/s0217595915400011openalex-snapshot
An Adaptive Smoothing Method for Continuous Minimax Problems
inferred← citeshttps://doi.org/10.1515/jaa-2022-1025openalex-snapshot
Smoothing Levenberg–Marquardt algorithm for solving non-Lipschitz absolute value equations
inferred← citeshttps://doi.org/10.21236/ada081802openalex-snapshot
Determining Feasibility of a Set of Nonlinear Inequality Constraints.
inferred← citeshttps://doi.org/10.2139/ssrn.6213024openalex-snapshot
Global Risk, Local Rules: Moral Hazard and International Portfolio Choice
inferred← citeshttps://doi.org/10.2514/6.2019-2299openalex-snapshot
Investigation of a Local Correlation-based Transition Model in a Newton-Krylov Algorithm
inferred← citeshttps://doi.org/10.31801/cfsuasmas.1150659openalex-snapshot
An exact penalty function approach for inequality constrained optimization problems based on a new smoothing technique
inferred← citeshttps://doi.org/10.32469/10355/75029openalex-snapshot
Approaches for unveiling the kinetic mechanisms of voltage gated ion channels in neurons
inferred← citeshttps://doi.org/10.33401/fujma.1261409openalex-snapshot
A New Smoothing Algorithm to Solve a System of Nonlinear Inequalities
inferred← citeshttps://doi.org/10.3934/jdg.2025043openalex-snapshot
A new smoothing newton-type two-step algorithm to solve non-lipschitz absolute value equations of the form $ Ax + B|x|^p = b $
inferred← citeshttps://doi.org/10.3934/jimo.2021170openalex-snapshot
Generalization of hyperbolic smoothing approach for non-smooth and non-Lipschitz functions
inferred← citeshttps://doi.org/10.3934/mfc.2024041openalex-snapshot
An application of exponential smoothing technique in image restoration
inferred← citeshttps://doi.org/10.3934/naco.2016006openalex-snapshot
A new smoothing approach to exact penalty functions for inequality constrained optimization problems
inferred← citeshttps://doi.org/10.3934/naco.2020004openalex-snapshot
On a new smoothing technique for non-smooth, non-convex optimization
inferred← citeshttps://doi.org/10.3934/naco.2021033openalex-snapshot
Smoothing approximations for piecewise smooth functions: A probabilistic approach
inferred← citeshttps://doi.org/10.3934/naco.2022022openalex-snapshot
Double stranded smoothing technique in energy minimization problems
inferred← citeshttps://doi.org/10.4236/jamp.2025.134084openalex-snapshot
Convergence Rate Analysis of Modified BiG-SAM for Solving Bi-Level Optimization Problems Based on S-FISTA
inferred← citeshttps://doi.org/10.48550/arxiv.1803.03885openalex-snapshot
Parallel FPGA Router using Sub-Gradient method and Steiner tree
inferred← citeshttps://doi.org/10.48550/arxiv.1805.08125openalex-snapshot
A Marketplace for Data: An Algorithmic Solution
inferred← citeshttps://doi.org/10.48550/arxiv.1811.07137openalex-snapshot
Optimization of Robot Tasks with Cartesian Degrees of Freedom using Virtual Joints
inferred← citeshttps://doi.org/10.48550/arxiv.1903.07164openalex-snapshot
Linearly Constrained Smoothing Group Sparsity Solvers in Off-grid Model
inferred← citeshttps://doi.org/10.48550/arxiv.2011.07753openalex-snapshot
A family of smooth piecewise-linear models with probabilistic interpretations
inferred← citeshttps://doi.org/10.55525/tjst.1366299openalex-snapshot
A New Approach to the Solution of Facility Layout Problems with Filled Function Method
inferred← citeshttps://doi.org/10.70675/55b4968dzdeabz43faz9fe4z60f845ba3b35openalex-snapshot
Approche parcimonieuse pour l’imagerie 3D haute résolution de surface équivalente radar.
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.