On Lipschitz optimization based on gray-box piecewise linearization
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 3855514 (Why is no real title available?)
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 3577030 (Why is no real title available?)
- scientific article; zbMATH DE number 3619637 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2133301 (Why is no real title available?)
- A derivative-free approximate gradient sampling algorithm for finite minimax problems
- A science fiction story in nonsmooth optimization originating at IIASA
- A simplex algorithm for piecewise-linear programming I: Derivation and proof
- An algorithm for nonsmooth optimization by successive piecewise linearization
- Coupling General Penalty Schemes for Convex Programming with the Steepest Descent and the Proximal Point Algorithm
- Evaluating Derivatives
- Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization
- Introduction to Piecewise Differentiable Equations
- Lexicographic differentiation of nonsmooth functions
- Limited memory bundle method for large bound constrained nonsmooth optimization: convergence analysis
- Nondifferentiable optimization and polynomial problems
- Nonsmooth optimization via quasi-Newton methods
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- On Nesterov's nonsmooth Chebyshev-Rosenbrock functions
- On stable piecewise linearization and generalized algorithmic differentiation
- Subgradient optimization in nonsmooth optimization (including the soviet revolution)
- Switching and stability properties of conewise linear systems
- Variable metric bundle methods: From conceptual to implementable forms
Cited in
(19)- Relaxing Kink Qualifications and Proving Convergence Rates in Piecewise Smooth Optimization
- First- and second-order optimality conditions for piecewise smooth objective functions
- Numerical simulation of differential-algebraic equations with embedded global optimization criteria
- 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
- A piecewise smooth version of the Griewank function
- Characterizing and testing subdifferential regularity in piecewise smooth optimization
- Manifold sampling for _1 nonconvex optimization
- A semismooth conjugate gradients method – theoretical analysis
- On solving nonsmooth retail portfolio maximization problems using active signature methods
- Manifold sampling for optimizing nonsmooth nonconvex compositions
- Structured nonsmooth optimization using functional encoding and branching information
- An algorithm for nonsmooth optimization by successive piecewise linearization
- The structure of conservative gradient fields
- 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
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)
