A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
From MaRDI portal
Publication:5317521
DOI10.1137/030601296zbMath1078.65048OpenAlexW2064942524MaRDI QIDQ5317521
Michael L. Overton, James V. Burke, Adrian S. Lewis
Publication date: 16 September 2005
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/030601296
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)
Related Items
Optimizing damper connectors for adjacent buildings, Linear system identification using the sequential stabilizing spline algorithm, \(\varepsilon\)-subgradient algorithms for locally Lipschitz functions on Riemannian manifolds, Comparing different nonsmooth minimization methods and software, A discussion on variational analysis in derivative-free optimization, Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization, A gradient sampling method based on ideal direction for solving nonsmooth optimization problems, On constraint qualifications and sensitivity analysis for general optimization problems via pseudo-Jacobians, Constraint qualifications and stationary conditions for mathematical programming with non-differentiable vanishing constraints, Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems, Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization, A CLASS OF NONLOCAL MODELS FOR PEDESTRIAN TRAFFIC, A heuristic for the stability number of a graph based on convex quadratic programming and tabu search, A new trust region method for nonsmooth nonconvex optimization, Efficient method for computing lower bounds on the \(p\)-radius of switched linear systems, Stability analysis of systems with stochastically varying delays, Improved convergence result for the discrete gradient and secant methods for nonsmooth optimization, Piecewise linear approximations in nonconvex nonsmooth optimization, Solving maximum-entropy sampling problems using factored masks, A derivative-free approximate gradient sampling algorithm for finite minimax problems, A conjugate gradient sampling method for nonsmooth optimization, Nonsmooth optimization via quasi-Newton methods, A globally convergent algorithm for nonconvex optimization based on block coordinate update, An extension of the quasi-Newton method for minimizing locally Lipschitz functions, SAA-regularized methods for multiproduct price optimization under the pure characteristics demand model, On the local convergence analysis of the gradient sampling method for finite max-functions, A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization, On the convergence analysis of a penalty algorithm for nonsmooth optimization and its performance for solving hard-sphere problems, Descent algorithm for nonsmooth stochastic multiobjective optimization, An effective nonsmooth optimization algorithm for locally Lipschitz functions, Nonsmooth spectral gradient methods for unconstrained optimization, Positive trigonometric polynomials for strong stability of difference equations, A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees, A nonsmooth optimisation approach for the stabilisation of time-delay systems, A Riemannian Gradient Sampling Algorithm for Nonsmooth Optimization on Manifolds, Complexity guarantees for an implicit smoothing-enabled method for stochastic MPECs, A primal nonsmooth reformulation for bilevel optimization problems, A DIRECT SEARCH QUASI-NEWTON METHOD FOR NONSMOOTH UNCONSTRAINED OPTIMIZATION, A superlinearly convergent \(R\)-regularized Newton scheme for variational models with concave sparsity-promoting priors, Stochastic absolute value equations, KSSOLV 2.0: an efficient Matlab toolbox for solving the Kohn-Sham equations with plane-wave basis set, A nonsmooth program for jamming hard spheres, Nonsmooth optimization reformulations characterizing all solutions of jointly convex generalized Nash equilibrium problems, Multivariable robust control for a 500W self-humidified PEMFC system, Generalized gradients in dynamic optimization, optimal control, and machine learning problems, Quasipolynomial approach to simultaneous robust control of time-delay systems, Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization, On Nesterov's nonsmooth Chebyshev-Rosenbrock functions, Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria, On solving simple bilevel programs with a nonconvex lower level program, Optimizing the asymptotic convergence rate of the Diaconis-Holmes-Neal sampler, An SQP method for minimization of locally Lipschitz functions with nonlinear constraints, An augmented subgradient method for minimizing nonsmooth DC functions, An SL/QP Algorithm for Minimizing the Spectral Abscissa of Time Delay Systems, A note on the smoothing quadratic regularization method for non-Lipschitz optimization, Diagonal bundle method for nonsmooth sparse optimization, Discrete gradient method: Derivative-free method for nonsmooth optimization, Large-Scale and Global Maximization of the Distance to Instability, A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization, GAITA: a Gauss-Seidel iterative thresholding algorithm for \(\ell_q\) regularized least squares regression, A feasible point method with bundle modification for nonsmooth convex constrained optimization, The noncooperative transportation problem and linear generalized Nash games, An adaptive competitive penalty method for nonsmooth constrained optimization, A fast gradient and function sampling method for finite-max functions, A convergence analysis of the method of codifferential descent, A Riemannian subgradient algorithm for economic dispatch with valve-point effect, Numerical investigation of Crouzeix's conjecture, Softness, sleekness and regularity properties in nonsmooth analysis, Nonsmooth optimization reformulations of player convex generalized Nash equilibrium problems, An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization, Codifferential method for minimizing nonsmooth DC functions, Smoothing methods for nonsmooth, nonconvex minimization, A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions, Algorithmic differentiation for piecewise smooth functions: a case study for robust optimization, Design of delay-based output-feedback controllers optimizing a quadratic cost function via the delay Lyapunov matrix, A Subgradient Method Based on Gradient Sampling for Solving Convex Optimization Problems, An efficient descent method for locally Lipschitz multiobjective optimization problems, Separation of convex sets by Clarke subdifferential, Fixed-structure robust controller design for chatter mitigation in high-speed milling, A smoothing augmented Lagrangian method for solving simple bilevel programs, GradSamp, Stochastic generalized gradient methods for training nonconvex nonsmooth neural networks, A proximal-projection partial bundle method for convex constrained minimax problems, On the differentiability check in gradient sampling methods, Solving linear generalized Nash equilibrium problems numerically, Low order-value optimization and applications, An algorithm for nonsmooth optimization by successive piecewise linearization, Local minimizers of the Crouzeix ratio: a nonsmooth optimization case study, Convergence of the gradient sampling algorithm on directionally Lipschitz functions, An approach for robust PDE-constrained optimization with application to shape optimization of electrical engines and of dynamic elastic structures under uncertainty, Multiscale sparse microcanonical models, Subgradient and Bundle Methods for Nonsmooth Optimization, Continuous outer subdifferentials in nonsmooth optimization, Minimum spectral connectivity projection pursuit. Divisive clustering using optimal projections for spectral clustering, Stable als approximation in the TT-format for rank-adaptive tensor completion, A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems, Design of structured controllers for linear time-delay systems, An adaptive gradient sampling algorithm for non-smooth optimization, Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization, Half-linear regularization for nonconvex image restoration models, A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions, A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions, Non-convex multiobjective optimization under uncertainty: a descent algorithm. Application to sandwich plate design and reliability, Unnamed Item, Eigenvalue optimisation-based centralised and decentralised stabilisation of time-delay systems, Interpolation of Functions with Parameter Dependent Jumps by Transformed Snapshots, Multifidelity Robust Controller Design with Gradient Sampling, SOBMOR: Structured Optimization-Based Model Order Reduction, A gradient sampling algorithm for stratified maps with applications to topological data analysis, A hierarchy of spectral relaxations for polynomial optimization, An Improved Unconstrained Approach for Bilevel Optimization, New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information, Regularized methods for a two-stage robust production planning problem and its sample average approximation, Fast computation of \(\mathrm{sep}_\lambda\) via interpolation-based globality certificates, Pathological Subgradient Dynamics, Making individually fair predictions with causal pathways, A New Sequential Optimality Condition for Constrained Nonsmooth Optimization, A new nonmonotone line search method for nonsmooth nonconvex optimization, An Approximation Scheme for Distributionally Robust Nonlinear Optimization, A Nonsmooth Trust-Region Method for Locally Lipschitz Functions with Application to Optimization Problems Constrained by Variational Inequalities, Relax-and-split method for nonconvex inverse problems, Transformed Snapshot Interpolation with High Resolution Transforms, Unnamed Item, Spectrum-based Stability Analysis and Stabilization of Time-periodic Time-delay Systems, Tuning Multigrid Methods with Robust Optimization and Local Fourier Analysis, Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions, Worst‐case stability and performance with mixed parametric and dynamic uncertainties, Derivative-free optimization methods for finite minimax problems, Minimization of marginal functions in mathematical programming based on continuous outer subdifferentials, The chain rule for VU-decompositions of nonsmooth functions, Analysis of the gradient method with an Armijo–Wolfe line search on a class of non-smooth convex functions, Essentials of numerical nonsmooth optimization, Subsampling Algorithms for Semidefinite Programming, A Gradient Sampling Method on Algebraic Varieties and Application to Nonsmooth Low-Rank Optimization, A splitting bundle approach for non-smooth non-convex minimization, Weakly Convex Optimization over Stiefel Manifold Using Riemannian Subgradient-Type Methods, Manifold Sampling for $\ell_1$ Nonconvex Optimization, Clarke Subgradients for Directionally Lipschitzian Stratifiable Functions, Weak subgradient method for solving nonsmooth nonconvex optimization problems, Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems, Essentials of numerical nonsmooth optimization, A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles
Uses Software
