On the public citation graph
Optimization of lipschitz continuous functions
0 signed · 169 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-319-89575-8_5openalex-snapshot
Iterative Solution of Nonlinear Equations
inferredcites →https://doi.org/10.1007/bf01070506openalex-snapshot
Convergence rate of the gradient descent method with dilatation of the space
inferredcites →https://doi.org/10.1007/bf01386389openalex-snapshot
Newton's method for convex programming and Tchebycheff approximation
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/bfb0120696openalex-snapshot
Nondifferentiable optimization via approximation
inferredcites →https://doi.org/10.1007/bfb0120700openalex-snapshot
An extension of davidon methods to non differentiable problems
inferredcites →https://doi.org/10.1007/bfb0120701openalex-snapshot
Minimax solution of non-linear equations without calculating derivatives
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.50012-2openalex-snapshot
OPTIMIZATION WITH CORNERS
inferredcites →https://doi.org/10.1016/s0022-0000(68)80034-0openalex-snapshot
Algorithms for some minimax problems
inferredcites →https://doi.org/10.1090/qam/10667openalex-snapshot
The method of steepest descent for non-linear minimization problems
inferredcites →https://doi.org/10.1090/s0002-9904-1943-07818-4openalex-snapshot
Variational methods for the solution of problems of equilibrium and vibrations
inferredcites →https://doi.org/10.1090/s0002-9947-1975-0367131-6openalex-snapshot
Generalized Gradients and Applications
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/1.9780898719468openalex-snapshot
Iterative Solution of Nonlinear Equations in Several Variables
inferredcites →https://doi.org/10.1287/moor.2.2.191openalex-snapshot
An Algorithm for Constrained Optimization with Semismooth Functions
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-0-387-74759-0_87openalex-snapshot
Continuous Approximations to Subdifferentials
inferred← citeshttps://doi.org/10.1007/978-1-4613-3279-4_2openalex-snapshot
A Monotonous Method for Unconstrained Lipschitz Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4613-3285-5_10openalex-snapshot
Approximations to the Clarke Generalized Jacobians and Nonsmooth Least-Squares Minimization
inferred← citeshttps://doi.org/10.1007/978-1-4757-3137-8_2openalex-snapshot
Numerical Methods for Minimizing Quasidifferentiable Functions: A Survey and Comparison
inferred← citeshttps://doi.org/10.1007/978-3-030-34910-3_6openalex-snapshot
Gradient Sampling Methods for Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_87-1openalex-snapshot
Continuous Approximations to Subdifferentials
inferred← citeshttps://doi.org/10.1007/978-3-031-33374-3_27openalex-snapshot
Model-Agnostic Reachability Analysis on Deep Neural Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-59073-3_6openalex-snapshot
ε-Intervals in Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-68874-4_15openalex-snapshot
Generalized Subgradients in Mathematical Programming
inferred← citeshttps://doi.org/10.1007/978-981-99-0890-5_6openalex-snapshot
Control of Flexible Manipulator
inferred← citeshttps://doi.org/10.1007/bf00249640openalex-snapshot
Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems
inferred← citeshttps://doi.org/10.1007/bf00250804openalex-snapshot
Univalence and degree for Lipschitz continuous maps
inferred← citeshttps://doi.org/10.1007/bf00933357openalex-snapshot
Algorithms for a class of nondifferentiable problems
inferred← citeshttps://doi.org/10.1007/bf00934131openalex-snapshot
Outer approximation algorithm for nondifferentiable optimization problems
inferred← citeshttps://doi.org/10.1007/bf00934553openalex-snapshot
Reflections on nondifferentiable optimization, part 2, convergence
inferred← citeshttps://doi.org/10.1007/bf00934719openalex-snapshot
Reflections on nondifferentiable optimization, part 1, ball gradient
inferred← citeshttps://doi.org/10.1007/bf00935008openalex-snapshot
Nondifferential optimization via adaptive smoothing
inferred← citeshttps://doi.org/10.1007/bf00935173openalex-snapshot
A minimization method for the sum of a convex function and a continuously differentiable function
inferred← citeshttps://doi.org/10.1007/bf00935443openalex-snapshot
Outer approximation algorithm for nondifferentiable optimization problems
inferred← citeshttps://doi.org/10.1007/bf00938396openalex-snapshot
Optimization of upper semidifferentiable functions
inferred← citeshttps://doi.org/10.1007/bf00939671openalex-snapshot
Extension of the Frank-Wolfe algorithm to concave nondifferentiable objective functions
inferred← citeshttps://doi.org/10.1007/bf01069307openalex-snapshot
Nonlocal minimization algorithms of nondifferentiable functions
inferred← citeshttps://doi.org/10.1007/bf01584377openalex-snapshot
Descent methods for composite nondifferentiable optimization problems
inferred← citeshttps://doi.org/10.1007/bf01609012openalex-snapshot
A subgradient algorithm for certain minimax and minisum problems
inferred← citeshttps://doi.org/10.1007/bf01789411openalex-snapshot
Subdifferentials of compactly lipschitzian vector-valued functions
inferred← citeshttps://doi.org/10.1007/bf02192206openalex-snapshot
Stochastic penalty function methods for nonsmooth constrained minimization
inferred← citeshttps://doi.org/10.1007/bf02294158openalex-snapshot
Weighted Minimum Trace Factor Analysis
inferred← citeshttps://doi.org/10.1007/bfb0113295openalex-snapshot
On a class of generalized gradient methods for solving locally lipschitz feasibility problems
inferred← citeshttps://doi.org/10.1007/bfb0121133openalex-snapshot
Nonsmoothness and quasidifferentiability
inferred← citeshttps://doi.org/10.1007/s10092-021-00448-zopenalex-snapshot
Local minimizers of the Crouzeix ratio: a nonsmooth optimization case study
inferred← citeshttps://doi.org/10.1007/s10107-019-01432-wopenalex-snapshot
Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria
inferred← citeshttps://doi.org/10.1007/s10107-022-01893-6openalex-snapshot
Complexity guarantees for an implicit smoothing-enabled method for stochastic MPECs
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/s10107-023-02031-6openalex-snapshot
No dimension-free deterministic algorithm computes approximate stationarities of Lipschitzians
inferred← citeshttps://doi.org/10.1007/s10107-025-02262-9openalex-snapshot
Lipschitz minimization and the Goldstein modulus
inferred← citeshttps://doi.org/10.1007/s10208-024-09653-yopenalex-snapshot
A Local Nearly Linearly Convergent First-Order Method for Nonsmooth Functions with Quadratic Growth
inferred← citeshttps://doi.org/10.1007/s10288-019-00404-2openalex-snapshot
A conjugate gradient sampling method for nonsmooth optimization
inferred← citeshttps://doi.org/10.1007/s10444-015-9426-zopenalex-snapshot
ε-subgradient algorithms for locally lipschitz functions on Riemannian manifolds
inferred← citeshttps://doi.org/10.1007/s10589-013-9547-6openalex-snapshot
A derivative-free approximate gradient sampling algorithm for finite minimax problems
inferred← citeshttps://doi.org/10.1007/s10589-018-0030-2openalex-snapshot
A fast gradient and function sampling method for finite-max functions
inferred← citeshttps://doi.org/10.1007/s10589-024-00552-0openalex-snapshot
A note on the convergence of deterministic gradient sampling in nonsmooth optimization
inferred← citeshttps://doi.org/10.1007/s10589-024-00597-1openalex-snapshot
A block-coordinate approach of multi-level optimization with an application to physics-informed neural networks
inferred← citeshttps://doi.org/10.1007/s10589-025-00745-1openalex-snapshot
Derivative-free stochastic bilevel optimization for inverse problems
inferred← citeshttps://doi.org/10.1007/s10898-026-01627-4openalex-snapshot
A truncated $$\varepsilon $$-subdifferential method for global DC optimization
inferred← citeshttps://doi.org/10.1007/s10957-009-9584-6openalex-snapshot
Improved Convergence Result for the Discrete Gradient and Secant Methods for Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1007/s10957-012-0024-7openalex-snapshot
An Effective Nonsmooth Optimization Algorithm for Locally Lipschitz Functions
inferred← citeshttps://doi.org/10.1007/s10957-014-0534-6openalex-snapshot
A New Nonsmooth Trust Region Algorithm for Locally Lipschitz Unconstrained Optimization Problems
inferred← citeshttps://doi.org/10.1007/s10957-017-1160-xopenalex-snapshot
On the Local Convergence Analysis of the Gradient Sampling Method for Finite Max-Functions
inferred← citeshttps://doi.org/10.1007/s10957-020-01803-wopenalex-snapshot
An Efficient Descent Method for Locally Lipschitz Multiobjective Optimization Problems
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-024-02520-4openalex-snapshot
A Descent Method for Nonsmooth Multiobjective Optimization in Hilbert Spaces
inferred← citeshttps://doi.org/10.1007/s10957-024-02551-xopenalex-snapshot
Weak Convexity and Approximate Subdifferentials
inferred← citeshttps://doi.org/10.1007/s10957-025-02748-8openalex-snapshot
Analyzing the Speed of Convergence in Nonsmooth Optimization via the Goldstein subdifferential
inferred← citeshttps://doi.org/10.1007/s10994-015-5540-xopenalex-snapshot
Tikhonov, Ivanov and Morozov regularization for support vector machine learning
inferred← citeshttps://doi.org/10.1007/s11075-012-9692-5openalex-snapshot
A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization
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/s11075-016-0208-6openalex-snapshot
An adaptive competitive penalty method for nonsmooth constrained optimization
inferred← citeshttps://doi.org/10.1007/s11075-022-01287-xopenalex-snapshot
On the convergence analysis of a penalty algorithm for nonsmooth optimization and its performance for solving hard-sphere problems
inferred← citeshttps://doi.org/10.1007/s11075-025-02269-5openalex-snapshot
An adaptive nonmonotone line search technique for nonsmooth optimization
inferred← citeshttps://doi.org/10.1007/s11228-018-0481-8openalex-snapshot
Continuous Outer Subdifferentials in Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1007/s11590-024-02158-1openalex-snapshot
Goldstein stationarity in Lipschitz constrained optimization
inferred← citeshttps://doi.org/10.1007/s12532-015-0086-2openalex-snapshot
A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees
inferred← citeshttps://doi.org/10.1007/s13675-017-0080-8openalex-snapshot
Nonsmooth spectral gradient methods for unconstrained optimization
inferred← citeshttps://doi.org/10.1016/0022-1236(78)90030-7openalex-snapshot
Calcul sous-differentiel et optimisation
inferred← citeshttps://doi.org/10.1016/0022-247x(82)90038-5openalex-snapshot
Hadamard's theorem for locally Lipschitzian maps
inferred← citeshttps://doi.org/10.1016/0022-247x(82)90130-5openalex-snapshot
On the Carathéodory-John Multiplier Rule
inferred← citeshttps://doi.org/10.1016/0022-247x(83)90179-8openalex-snapshot
Homeomorphisms and generalized derivatives
inferred← citeshttps://doi.org/10.1016/0098-1354(88)87008-xopenalex-snapshot
Computation of complex equilibria by nonlinear optimization
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/j.aei.2026.105195openalex-snapshot
Regularized interpolation in 4D neural fields optimizes geometric fidelity in 3D printing
inferred← citeshttps://doi.org/10.1016/j.automatica.2024.112068openalex-snapshot
Distributed Online Optimization with Edge-Based Event-Triggered communication
inferred← citeshttps://doi.org/10.1016/j.cam.2013.07.002openalex-snapshot
A Riemannian subgradient algorithm for economic dispatch with valve-point effect
inferred← citeshttps://doi.org/10.1016/j.ejco.2025.100110openalex-snapshot
Direct-search methods in the year 2025: Theoretical guarantees and algorithmic paradigms
inferred← citeshttps://doi.org/10.1016/j.ins.2020.05.046openalex-snapshot
Early prediction for mode anomaly in generative adversarial network training: An empirical study
inferred← citeshttps://doi.org/10.1016/j.knosys.2025.113717openalex-snapshot
Decentralized federated learning meets Physics-Informed Neural Networks
inferred← citeshttps://doi.org/10.1016/j.knosys.2025.114935openalex-snapshot
One-step incomplete multi-view clustering via imputed anchor graph discretization
inferred← citeshttps://doi.org/10.1016/s0362-546x(97)00511-7openalex-snapshot
ε-Subdifferential and ε-monotonicity
inferred← citeshttps://doi.org/10.1023/a:1008224107486openalex-snapshot
Global Interval Methods for Local Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1080/00029890.1980.11995060openalex-snapshot
Modern Multiplier Rules
inferred← citeshttps://doi.org/10.1080/00036818008839315openalex-snapshot
On directions of ∊-steepest descent for real-valued lipschitz continuous functions
inferred← citeshttps://doi.org/10.1080/01630569408816574openalex-snapshot
∊ -gradients pour les ponctions localements lipschitziennes et applications
inferred← citeshttps://doi.org/10.1080/02331934.2012.687736openalex-snapshot
Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization
inferred← citeshttps://doi.org/10.1080/02331934.2016.1171865openalex-snapshot
Diagonal discrete gradient bundle method for derivative free nonsmooth optimization
inferred← citeshttps://doi.org/10.1080/02331934.2018.1470175openalex-snapshot
A new trust region method for nonsmooth nonconvex optimization
inferred← citeshttps://doi.org/10.1080/02331934.2018.1545123openalex-snapshot
An SQP method for minimization of locally Lipschitz functions with nonlinear constraints
inferred← citeshttps://doi.org/10.1080/02331934.2024.2322152openalex-snapshot
A descent subgradient method using Mifflin's line search for nonsmooth nonconvex optimization
inferred← citeshttps://doi.org/10.1080/02331938308842828openalex-snapshot
On quasidifferentiable mappings
inferred← citeshttps://doi.org/10.1080/02331938608843117openalex-snapshot
Generalized Gradients and Paths of Descent
inferred← citeshttps://doi.org/10.1080/02331939908844455openalex-snapshot
Continuous approximations to generalized jacobians
inferred← citeshttps://doi.org/10.1080/10556788.2012.714781openalex-snapshot
An adaptive gradient sampling algorithm for non-smooth optimization
inferred← citeshttps://doi.org/10.1080/10556788.2024.2331068openalex-snapshot
A semismooth conjugate gradients method – theoretical analysis
inferred← citeshttps://doi.org/10.1090/s0002-9947-1986-0819935-8openalex-snapshot
Clarke's Gradients and Epsilon-Subgradients in Banach Spaces
inferred← citeshttps://doi.org/10.1093/imanum/drac016openalex-snapshot
A sequential optimality condition for Mathematical Programs with equilibrium constraints based on a nonsmooth formulation
inferred← citeshttps://doi.org/10.1093/imanum/drz008openalex-snapshot
A self-correcting variable-metric algorithm framework for nonsmooth optimization
inferred← citeshttps://doi.org/10.1109/cacsd-cca-isic.2006.4776867openalex-snapshot
Linear controller retuning approach based on nonconvex nonsmooth optimization
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/cdc.1983.269661openalex-snapshot
Algorithm models for nondifferentiable optimization
inferred← citeshttps://doi.org/10.1109/cdc.2005.1582974openalex-snapshot
Backstepping Controller Retuning using ε Subdifferential Optimization
inferred← citeshttps://doi.org/10.1109/icassp40776.2020.9054424openalex-snapshot
Stochastic Graph Neural Networks
inferred← citeshttps://doi.org/10.1109/icc54714.2021.9703135openalex-snapshot
Zeroth-order randomized block methods for constrained minimization of expectation-valued Lipschitz continuous functions
inferred← citeshttps://doi.org/10.1109/jsen.2026.3699731openalex-snapshot
Toward Interpretable Deep Diagnosis: A Multilayer Convolutional Sparse Model With Fast Iterative Solver for Bearing Fault Diagnosis
inferred← citeshttps://doi.org/10.1109/mlcad65511.2025.11189141openalex-snapshot
Recurrent CircuitSAT Sampling for Sequential Circuits
inferred← citeshttps://doi.org/10.1109/msp.2026.3662660openalex-snapshot
Computational Nonsmooth Analysis: Modern applications and recent developments [Special Issue on the Mathematics of Deep Learning]
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/tcs.1979.1084702openalex-snapshot
Theoretical and computational aspects of the optimal design centering, tolerancing, and tuning problem
inferred← citeshttps://doi.org/10.1109/tits.2024.3453955openalex-snapshot
Dual Model Pruning Enables Efficient Federated Learning in Intelligent Transportation Systems
inferred← citeshttps://doi.org/10.1109/tpami.2022.3215914openalex-snapshot
The Proxy Step-Size Technique for Regularized Optimization on the Sphere Manifold
inferred← citeshttps://doi.org/10.1109/tsipn.2026.3682867openalex-snapshot
Distributed Nonsmooth Nonconvex Optimization: Deterministic and Stochastic Zeroth-Order Algorithms With Decaying Step Sizes
inferred← citeshttps://doi.org/10.1109/tsp.2021.3092336openalex-snapshot
Stochastic Graph Neural Networks
inferred← citeshttps://doi.org/10.1109/ucc63386.2024.00053openalex-snapshot
Quantum Federated Learning: Bridging Quantum Computing and Distributed AI
inferred← citeshttps://doi.org/10.1137/030601296openalex-snapshot
A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
inferred← citeshttps://doi.org/10.1137/0320034openalex-snapshot
A Subgradient Algorithm for Certain Minimax and Minisum Problems—The Constrained Case
inferred← citeshttps://doi.org/10.1137/0321010openalex-snapshot
On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable 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/0323031openalex-snapshot
Algorithm Models for Nondifferentiable Optimization
inferred← citeshttps://doi.org/10.1137/050639673openalex-snapshot
Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
inferred← citeshttps://doi.org/10.1137/0806013openalex-snapshot
Restricted Step and Levenberg–Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization
inferred← citeshttps://doi.org/10.1137/090748408openalex-snapshot
A Nonderivative Version of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
inferred← citeshttps://doi.org/10.1137/1021027openalex-snapshot
Optimal Control and the True Hamiltonian
inferred← citeshttps://doi.org/10.1137/17m1153571openalex-snapshot
A Gradient Sampling Method on Algebraic Varieties and Application to Nonsmooth Low-Rank Optimization
inferred← citeshttps://doi.org/10.1137/18m1164925openalex-snapshot
A Nonsmooth Trust-Region Method for Locally Lipschitz Functions with Application to Optimization Problems Constrained by Variational Inequalities
inferred← citeshttps://doi.org/10.1137/18m1228608openalex-snapshot
A New Sequential Optimality Condition for Constrained Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1137/23m1626724openalex-snapshot
Zeroth-Order Gradient and Quasi-Newton Methods for Nonsmooth Nonconvex Stochastic Optimization
inferred← citeshttps://doi.org/10.1137/24m1659911openalex-snapshot
Subdifferentially Polynomially Bounded Functions and Gaussian Smoothing–Based Zeroth-Order Optimization
inferred← citeshttps://doi.org/10.1145/3295500.3356137openalex-snapshot
Large-batch training for LSTM and beyond
inferred← citeshttps://doi.org/10.1145/3439723openalex-snapshot
Generative Adversarial Networks in Computer Vision
inferred← citeshttps://doi.org/10.1146/annurev-control-042920-020021openalex-snapshot
Toward a Theoretical Foundation of Policy Optimization for Learning Control Policies
inferred← citeshttps://doi.org/10.1155/2014/192893openalex-snapshot
A Cutting Plane and Level Stabilization Bundle Method with Inexact Data for Minimizing Nonsmooth Nonconvex Functions
inferred← citeshttps://doi.org/10.1287/ijoo.2022.0073openalex-snapshot
Gradient Sampling Methods with Inexact Subproblem Solutions and Gradient Aggregation
inferred← citeshttps://doi.org/10.1287/moor.10.2.185openalex-snapshot
A Linearization Algorithm for Nonsmooth Minimization
inferred← citeshttps://doi.org/10.1287/moor.14.2.343openalex-snapshot
Random Search Algorithms with Sufficient Descent for Minimization of Functions
inferred← citeshttps://doi.org/10.1287/moor.2.2.191openalex-snapshot
An Algorithm for Constrained Optimization with Semismooth Functions
inferred← citeshttps://doi.org/10.1287/moor.2022.0289openalex-snapshot
The Cost of Nonconvexity in Deterministic Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1287/moor.2023.0202openalex-snapshot
Variational Theory and Algorithms for a Class of Asymptotically Approachable Nonconvex Problems
inferred← citeshttps://doi.org/10.1609/aaai.v36i9.21280openalex-snapshot
Procrastinated Tree Search: Black-Box Optimization with Delayed, Noisy, and Multi-Fidelity Feedback
inferred← citeshttps://doi.org/10.1609/aaai.v38i16.29697openalex-snapshot
Decentralized Gradient-Free Methods for Stochastic Non-smooth Non-convex Optimization
inferred← citeshttps://doi.org/10.23919/acc60939.2024.10644325openalex-snapshot
Nonsmooth-Optimization-Based Bandwidth Optimal Control for Precision Motion Systems
inferred← citeshttps://doi.org/10.24033/msmf.261openalex-snapshot
New concepts in nondifferentiable programming
inferred← citeshttps://doi.org/10.3389/fnins.2025.1652274openalex-snapshot
Spiking neural networks for EEG signal analysis using wavelet transform
inferred← citeshttps://doi.org/10.4153/cjm-1980-020-7openalex-snapshot
Generalized Directional Derivatives and Subgradients of Nonconvex Functions
inferred← citeshttps://doi.org/10.48550/arxiv.1906.01529openalex-snapshot
Generative Adversarial Networks in Computer Vision: A Survey and Taxonomy
inferred← citeshttps://doi.org/10.48550/arxiv.1910.11199openalex-snapshot
A nonsmooth nonconvex descent algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.2002.04130openalex-snapshot
Complexity of Finding Stationary Points of Nonsmooth Nonconvex Functions
inferred← citeshttps://doi.org/10.48550/arxiv.2002.11962openalex-snapshot
Can We Find Near-Approximately-Stationary Points of Nonsmooth Nonconvex Functions?
inferred← citeshttps://doi.org/10.48550/arxiv.2007.00708openalex-snapshot
Learning Search Space Partition for Black-box Optimization using Monte Carlo Tree Search
inferred← citeshttps://doi.org/10.48550/arxiv.2104.06763openalex-snapshot
Oracle Complexity in Nonsmooth Nonconvex Optimization
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.