On Lipschitz optimization based on gray-box piecewise linearization
DOI10.1007/S10107-015-0934-XzbMATH Open1350.49038DBLPjournals/mp/GriewankWFB16OpenAlexW1179775547WikidataQ57389574 ScholiaQ57389574MaRDI QIDQ304252FDOQ304252
Authors: Andreas Griewank, Andrea Walther, Sabrina Fiege, Torsten Bosse 
Publication date: 25 August 2016
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-015-0934-x
Recommendations
- An algorithm for nonsmooth optimization by successive piecewise linearization
- Algorithmic differentiation for piecewise smooth functions: a case study for robust optimization
- Piecewise linear approximations in nonconvex nonsmooth optimization
- scientific article; zbMATH DE number 757681
- scientific article; zbMATH DE number 3924518
Nonsmooth analysis (49J52) Derivative-free methods and methods using generalized derivatives (90C56)
Cites Work
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Title not available (Why is that?)
- Title not available (Why is that?)
- Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization
- Title not available (Why is that?)
- Evaluating Derivatives
- Title not available (Why is that?)
- Variable metric bundle methods: From conceptual to implementable forms
- Introduction to Piecewise Differentiable Equations
- Title not available (Why is that?)
- Nonsmooth optimization via quasi-Newton methods
- Limited memory bundle method for large bound constrained nonsmooth optimization: convergence analysis
- Nondifferentiable optimization and polynomial problems
- Subgradient optimization in nonsmooth optimization (including the soviet revolution)
- A science fiction story in nonsmooth optimization originating at IIASA
- An algorithm for nonsmooth optimization by successive piecewise linearization
- Lexicographic differentiation of nonsmooth functions
- On stable piecewise linearization and generalized algorithmic differentiation
- Switching and stability properties of conewise linear systems
- A derivative-free approximate gradient sampling algorithm for finite minimax problems
- A simplex algorithm for piecewise-linear programming I: Derivation and proof
- Title not available (Why is that?)
- Title not available (Why is that?)
- Coupling General Penalty Schemes for Convex Programming with the Steepest Descent and the Proximal Point Algorithm
- On Nesterov's nonsmooth Chebyshev-Rosenbrock functions
Cited In (15)
- Relaxing Kink Qualifications and Proving Convergence Rates in Piecewise Smooth Optimization
- First- and second-order optimality conditions for piecewise smooth objective functions
- On the abs-polynomial expansion of piecewise smooth functions
- Finite convergence of an active signature method to local minima of piecewise linear functions
- Conservative set valued fields, automatic differentiation, stochastic gradient methods and deep learning
- Characterizing and testing subdifferential regularity in piecewise smooth optimization
- Manifold sampling for \(\ell_1\) nonconvex optimization
- A semismooth conjugate gradients method – theoretical analysis
- Manifold sampling for optimizing nonsmooth nonconvex compositions
- The structure of conservative gradient fields
- An algorithm for nonsmooth optimization by successive piecewise linearization
- Branch-locking AD techniques for nonsmooth composite functions and nonsmooth implicit functions
- Computationally relevant generalized derivatives: theory, evaluation and applications
- Derivative-free optimization methods
- Algorithmic differentiation for piecewise smooth functions: a case study for robust optimization
Uses Software
This page was built for publication: On Lipschitz optimization based on gray-box piecewise linearization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q304252)
