Nonsmooth optimization via quasi-Newton methods
From MaRDI portal
Publication:378113
DOI10.1007/S10107-012-0514-2zbMATH Open1280.90118OpenAlexW2151568819MaRDI QIDQ378113FDOQ378113
Authors: Michael L. Overton, A. S. Lewis 
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
Recommendations
- Convergence Rates of Quasi-Newton Algorithms for Some Nonsmooth Optimization Problems
- Nonsmoothness and a variable metric method
- A direct search quasi-Newton method for nonsmooth unconstrained optimization
- Nonsmooth variants of Powell's BFGS convergence theorem
- A quasisecant method for minimizing nonsmooth functions
Cites Work
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- New limited memory bundle method for large-scale nonsmooth optimization
- Variational Analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- A family of variable metric proximal methods
- Methods of descent for nondifferentiable optimization
- Composite proximal bundle method
- Optimization and nonsmooth analysis
- Title not available (Why is that?)
- Globally convergent variable metric method for convex nonsmooth unconstrained minimization
- Title not available (Why is that?)
- The BFGS method with exact line searches fails for non-convex objective functions
- On the global convergence of the BFGS method for nonconvex unconstrained optimization problems
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
- An Algorithm for Constrained Optimization with Semismooth Functions
- Quasi-Newton Bundle-Type Methods for Nondifferentiable Convex Optimization
- Convergence Properties of the BFGS Algoritm
- Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
- Constrained maximum-entropy sampling
- Optimization of spectral functions of Dirichlet-Laplacian eigenvalues
- The condition metric in the space of rectangular full rank matrices
- The 𝒰-Lagrangian of a convex function
- Active Sets, Nonsmoothness, and Sensitivity
- On Nesterov's nonsmooth Chebyshev-Rosenbrock functions
- Globally convergent BFGS method for nonsmooth convex optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Quasi Newton techniques generate identical points II: The proofs of four new theorems
- Title not available (Why is that?)
Cited In (only showing first 100 items - show all)
- Optimal subgradient methods: computational properties for large-scale linear inverse problems
- Identifying behaviorally robust strategies for normal form games under varying forms of uncertainty
- Composite proximal bundle method
- A greedy algorithm for optimal heating in powder-bed-based additive manufacturing
- Quasi-Newton methods for solving nonlinear programming problems
- An Approximation Scheme for Distributionally Robust Nonlinear Optimization
- A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles
- A deep learning energy method for hyperelasticity and viscoelasticity
- Line search algorithms for locally Lipschitz functions on Riemannian manifolds
- An augmented subgradient method for minimizing nonsmooth DC functions
- Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems
- A radial boundary intersection aided interior point method for multi-objective optimization
- Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons
- AUV based source seeking with estimated gradients
- Global convergence of a modified two-parameter scaled BFGS method with Yuan-Wei-Lu line search for unconstrained optimization
- Solving nearly-separable quadratic optimization problems as nonsmooth equations
- A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization
- A fast gradient and function sampling method for finite-max functions
- Three-dimensional phase-field modeling of mode I + II/III failure in solids
- Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
- The noncooperative transportation problem and linear generalized Nash games
- An SL/QP algorithm for minimizing the spectral abscissa of time delay systems
- Polynomial root radius optimization with affine constraints
- A quasi-Newton approach to nonsmooth convex optimization problems in machine learning
- Optimization of spectral functions of Dirichlet-Laplacian eigenvalues
- A convergence analysis of the method of codifferential descent
- On reduced input-output dynamic mode decomposition
- Wasserstein loss for image synthesis and restoration
- On Lipschitz optimization based on gray-box piecewise linearization
- Proximal bundle methods for nonsmooth DC programming
- New results on superlinear convergence of classical quasi-Newton methods
- Line search fixed point algorithms based on nonlinear conjugate gradient directions: application to constrained smooth convex optimization
- Quasi-Newton minimization for the \(p(x)\)-Laplacian problem
- On Nesterov's nonsmooth Chebyshev-Rosenbrock functions
- Solving linear generalized Nash equilibrium problems numerically
- Mixing convex-optimization bounds for maximum-entropy sampling
- Local linear convergence of the ADMM/Douglas-Rachford algorithms without strong convexity and application to statistical imaging
- Maximization of Laplace-Beltrami eigenvalues on closed Riemannian surfaces
- A hierarchy of spectral relaxations for polynomial optimization
- A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions
- On quasi-Newton forward-backward splitting: proximal calculus and convergence
- On optimal control of a sweeping process coupled with an ordinary differential equation
- Convergence Rates of Quasi-Newton Algorithms for Some Nonsmooth Optimization Problems
- A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees
- Numerical investigation of Crouzeix's conjecture
- Approximate residual-minimizing shift parameters for the low-rank ADI iteration
- Title not available (Why is that?)
- Low complexity secant quasi-Newton minimization algorithms for nonconvex functions
- Nonsmoothness and a variable metric method
- Title not available (Why is that?)
- A generalised phase field model for fatigue crack growth in elastic-plastic solids with an efficient monolithic solver
- Quadratic Convergence of Smoothing Newton's Method for 0/1 Loss Optimization
- A Riemannian gradient sampling algorithm for nonsmooth optimization on manifolds
- SAA-regularized methods for multiproduct price optimization under the pure characteristics demand model
- A splitting bundle approach for non-smooth non-convex minimization
- Derivative-Free Optimization of Noisy Functions via Quasi-Newton Methods
- A parameterized Newton method and a quasi-Newton method for nonsmooth equations
- A direct search quasi-Newton method for nonsmooth unconstrained optimization
- Secant penalized BFGS: a noise robust quasi-Newton method via penalizing the secant condition
- An algorithm for nonsmooth optimization by successive piecewise linearization
- A nonsmooth trust-region method for locally Lipschitz functions with application to optimization problems constrained by variational inequalities
- Discrete optimal transport: complexity, geometry and applications
- A conjugate gradient sampling method for nonsmooth optimization
- A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems
- IMRO: A proximal quasi-Newton method for solving \(\ell_1\)-regularized least squares problems
- Algorithmic differentiation for piecewise smooth functions: a case study for robust optimization
- On the differentiability check in gradient sampling methods
- Dai-Kou type conjugate gradient methods with a line search only using gradient
- An adaptive competitive penalty method for nonsmooth constrained optimization
- Short communication: Monte Carlo expected wealth and risk measure trade-off portfolio optimization
- Proximal variable metric method with spectral diagonal update for large scale sparse optimization
- 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
- Analysis of the gradient method with an Armijo-Wolfe line search on a class of non-smooth convex functions
- Minimum spectral connectivity projection pursuit. Divisive clustering using optimal projections for spectral clustering
- Superlinear convergence of Broyden's method and BFGS algorithm using Kantorovich-type assumptions
- A new sequential optimality condition for constrained nonsmooth optimization
- Superlinear convergence of nonlinear conjugate gradient method and scaled memoryless BFGS method based on assumptions about the initial point
- Incremental quasi-Newton algorithms for solving a nonconvex, nonsmooth, finite-sum optimization problem
- Variational temporal convolutional networks for I-FENN thermoelasticity
- A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions
- 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
- Harnessing Structure in Composite Nonsmooth Minimization
- A gradient sampling algorithm for stratified maps with applications to topological data analysis
- Pseudo-feasible solutions in evolutionary bilevel optimization: test problems and performance assessment
- Adaptive FISTA for Nonconvex Optimization
- Nearest rank deficient matrix polynomials
- A variational derivation of a class of BFGS-like methods
- Survey Descent: A Multipoint Generalization of Gradient Descent for Nonsmooth Optimization
- Combining discrete and continuous optimization to solve kinodynamic motion planning problems
- Finite convergence of an active signature method to local minima of piecewise linear functions
- Greedy quasi-Newton methods with explicit superlinear convergence
- Limited-memory BFGS with displacement aggregation
- Rates of superlinear convergence for classical quasi-Newton methods
- A globally convergent hybrid conjugate gradient method and its numerical behaviors
- Parametric convex quadratic relaxation of the quadratic knapsack problem
- Optimization-Based Modal Decomposition for Systems with Multiple Transports
- Adapting regularized low-rank models for parallel architectures
- Tuning Multigrid Methods with Robust Optimization and Local Fourier Analysis
Uses Software
This page was built for publication: Nonsmooth optimization via quasi-Newton methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q378113)
