Structured nonsmooth optimization using functional encoding and branching information

DOI10.1007/S10589-026-00775-3MaRDI QIDQ7262399zbMATH OpenFDO

Authors Fengqiao Luo

Publication date 11 June 2026

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10589-026-00775-3

zbMATH Keywords

branching informationfunctional encodingnonsmooth optimizationsmooth substructure

Mathematics Subject Classification ID

Numerical analysis (65-XX) Operations research, mathematical programming (90-XX) Mathematical programming (90Cxx)

Cites work

• A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions
• A bundle-Newton method for nonsmooth unconstrained minimization
• A filter proximal bundle method for nonsmooth nonconvex constrained optimization
• A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization
• A proximal bundle method based on approximate subgradients
• A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
• A proximal bundle method for nonsmooth nonconvex functions with inexact information
• A Proximal Bundle Method with Approximate Subgradient Linearizations
• A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees
• A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions
• A redistributed proximal bundle method for nonconvex optimization
• A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
• A superlinearly convergent subgradient method for sharp semismooth problems
• A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods
• Algorithmic differentiation for piecewise smooth functions: a case study for robust optimization
• An algorithm for nonsmooth optimization by successive piecewise linearization
• An effective nonsmooth optimization algorithm for locally Lipschitz functions
• An efficient descent method for locally Lipschitz multiobjective optimization problems
• Bundle method for nonconvex nonsmooth constrained optimization
• Composite proximal bundle method
• Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
• Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems
• First- and second-order optimality conditions for piecewise smooth objective functions
• scientific article; zbMATH DE number 46303 (Why is no real title available?)
• scientific article; zbMATH DE number 3619635 (Why is no real title available?)
• Introduction to nonsmooth optimization. Theory, practice and software
• Modern nonconvex nondifferentiable optimization
• New limited memory bundle method for large-scale nonsmooth optimization
• Nonconvex bundle method with application to a delamination problem
• Nonsmooth optimization via quasi-Newton methods
• On a Frank-Wolfe approach for abs-smooth functions
• On Lipschitz optimization based on gray-box piecewise linearization
• On stable piecewise linearization and generalized algorithmic differentiation
• Optimal Convergence Rates for the Proximal Bundle Method
• OSQP: an operator splitting solver for quadratic programs
• Quasi-Newton Bundle-Type Methods for Nondifferentiable Convex Optimization
• Rate of convergence of the bundle method
• Relaxing Kink Qualifications and Proving Convergence Rates in Piecewise Smooth Optimization
• Restricted Step and Levenberg–Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization
• Survey Descent: A Multipoint Generalization of Gradient Descent for Nonsmooth Optimization

This page was built for publication: Structured nonsmooth optimization using functional encoding and branching information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7262399)