Nonsmooth optimization via quasi-Newton methods

DOI10.1007/S10107-012-0514-2zbMath1280.90118OpenAlexW2151568819MaRDI QIDQ378113

Publication date: 11 November 2013

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-012-0514-2

zbMATH Keywords

nonconvex line search $R$-linear convergence BFGS Clarke stationary partly smooth

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (only showing first 100 items - show all)

Combining discrete and continuous optimization to solve kinodynamic motion planning problems ⋮ Survey Descent: A Multipoint Generalization of Gradient Descent for Nonsmooth Optimization ⋮ A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions ⋮ Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems ⋮ A greedy algorithm for optimal heating in powder-bed-based additive manufacturing ⋮ On Lipschitz optimization based on gray-box piecewise linearization ⋮ A globally convergent hybrid conjugate gradient method and its numerical behaviors ⋮ On the Complexity Analysis of the Primal Solutions for the Accelerated Randomized Dual Coordinate Ascent ⋮ A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions ⋮ Wasserstein Loss for Image Synthesis and Restoration ⋮ Limited-memory BFGS with displacement aggregation ⋮ Rates of superlinear convergence for classical quasi-Newton methods ⋮ Local Linear Convergence of the ADMM/Douglas--Rachford Algorithms without Strong Convexity and Application to Statistical Imaging ⋮ Composite proximal bundle method ⋮ A conjugate gradient sampling method for nonsmooth optimization ⋮ Optimization of spectral functions of Dirichlet-Laplacian eigenvalues ⋮ Polynomial root radius optimization with affine constraints ⋮ SAA-regularized methods for multiproduct price optimization under the pure characteristics demand model ⋮ Eigenvalue optimisation-based centralised and decentralised stabilisation of time-delay systems ⋮ A deep learning energy method for hyperelasticity and viscoelasticity ⋮ Phase field modeling of brittle fracture in large-deformation solid shells with the efficient quasi-Newton solution and global-local approach ⋮ Multifidelity Robust Controller Design with Gradient Sampling ⋮ Harnessing Structure in Composite Nonsmooth Minimization ⋮ A gradient sampling algorithm for stratified maps with applications to topological data analysis ⋮ A hierarchy of spectral relaxations for polynomial optimization ⋮ Enhanced physics‐informed neural networks for hyperelasticity ⋮ A version of bundle trust region method with linear programming ⋮ 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 ⋮ A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees ⋮ A New Sequential Optimality Condition for Constrained Nonsmooth 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 ⋮ A Riemannian Gradient Sampling Algorithm for Nonsmooth Optimization on Manifolds ⋮ A primal nonsmooth reformulation for bilevel optimization problems ⋮ Maximization of Laplace−Beltrami eigenvalues on closed Riemannian surfaces ⋮ Secant penalized BFGS: a noise robust quasi-Newton method via penalizing the secant condition ⋮ Line Search Algorithms for Locally Lipschitz Functions on Riemannian Manifolds ⋮ Range-Based ICA Using a Nonsmooth Quasi-Newton Optimizer for Electroencephalographic Source Localization in Focal Epilepsy ⋮ Wasserstein barycenters in the manifold of all positive definite matrices ⋮ On Nesterov's nonsmooth Chebyshev-Rosenbrock functions ⋮ Superlinear convergence of Broyden's method and BFGS algorithm using Kantorovich-type assumptions ⋮ On optimal control of a sweeping process coupled with an ordinary differential equation ⋮ Derivative-Free Optimization of Noisy Functions via Quasi-Newton Methods ⋮ An augmented subgradient method for minimizing nonsmooth DC functions ⋮ Tuning Multigrid Methods with Robust Optimization and Local Fourier Analysis ⋮ An SL/QP Algorithm for Minimizing the Spectral Abscissa of Time Delay Systems ⋮ Nonsmooth Variants of Powell's BFGS Convergence Theorem ⋮ AUV based source seeking with estimated gradients ⋮ Adapting Regularized Low-Rank Models for Parallel Architectures ⋮ A variational derivation of a class of BFGS-like methods ⋮ A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization ⋮ Pseudo-feasible solutions in evolutionary bilevel optimization: test problems and performance assessment ⋮ Dai-Kou type conjugate gradient methods with a line search only using gradient ⋮ 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 ⋮ On reduced input-output dynamic mode decomposition ⋮ Numerical investigation of Crouzeix's conjecture ⋮ IMRO: A Proximal Quasi-Newton Method for Solving $\ell_1$-Regularized Least Squares Problems ⋮ Global convergence of a modified two-parameter scaled BFGS method with Yuan-Wei-Lu line search for unconstrained optimization ⋮ Unnamed Item ⋮ Three-dimensional phase-field modeling of mode I + II/III failure in solids ⋮ Proximal bundle methods for nonsmooth DC programming ⋮ Algorithmic differentiation for piecewise smooth functions: a case study for robust optimization ⋮ Identifying behaviorally robust strategies for normal form games under varying forms of uncertainty ⋮ Design of delay-based output-feedback controllers optimizing a quadratic cost function via the delay Lyapunov matrix ⋮ Finite convergence of an active signature method to local minima of piecewise linear functions ⋮ A radial boundary intersection aided interior point method for multi-objective optimization ⋮ New results on superlinear convergence of classical quasi-Newton methods ⋮ Superlinear convergence of nonlinear conjugate gradient method and scaled memoryless BFGS method based on assumptions about the initial point ⋮ Line search fixed point algorithms based on nonlinear conjugate gradient directions: application to constrained smooth convex optimization ⋮ Analysis of the gradient method with an Armijo–Wolfe line search on a class of non-smooth convex functions ⋮ Mixing convex-optimization bounds for maximum-entropy sampling ⋮ Approximate residual-minimizing shift parameters for the low-rank ADI iteration ⋮ A generalised phase field model for fatigue crack growth in elastic-plastic solids with an efficient monolithic solver ⋮ On the differentiability check in gradient sampling methods ⋮ Solving linear generalized Nash equilibrium problems numerically ⋮ Optimal subgradient methods: computational properties for large-scale linear inverse problems ⋮ An algorithm for nonsmooth optimization by successive piecewise linearization ⋮ Local minimizers of the Crouzeix ratio: a nonsmooth optimization case study ⋮ On Quasi-Newton Forward-Backward Splitting: Proximal Calculus and Convergence ⋮ Adaptive FISTA for Nonconvex Optimization ⋮ Functional random effects modeling of brain shape and connectivity ⋮ Optimization-Based Modal Decomposition for Systems with Multiple Transports ⋮ Parametric convex quadratic relaxation of the quadratic knapsack problem ⋮ Minimum spectral connectivity projection pursuit. Divisive clustering using optimal projections for spectral clustering ⋮ A splitting bundle approach for non-smooth non-convex minimization ⋮ A geometric integration approach to nonsmooth, nonconvex optimisation ⋮ Greedy Quasi-Newton Methods with Explicit Superlinear Convergence ⋮ A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems ⋮ Pseudospectral methods and iterative solvers for optimization problems from multiscale particle dynamics ⋮ Structured learning based heuristics to solve the single machine scheduling problem with release times and sum of completion times ⋮ Nonsmoothness and a variable metric method ⋮ Narrowing the difficulty gap for the Celis-Dennis-Tapia problem ⋮ A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles ⋮ Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons ⋮ Discrete optimal transport: complexity, geometry and applications ⋮ Proximal variable metric method with spectral diagonal update for large scale sparse optimization

Uses Software

Cites Work

This page was built for publication: Nonsmooth optimization via quasi-Newton methods