Relaxing Kink Qualifications and Proving Convergence Rates in Piecewise Smooth Optimization

DOI10.1137/17M1157623zbMath1410.90252OpenAlexW2914532563MaRDI QIDQ4620420

Andreas Griewank, Andrea Walther

Publication date: 8 February 2019

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/17m1157623

zbMATH Keywords

quadratic convergencelinear convergenceABS-normal formsecond order sufficiency conditionKKTKarush-Kuhn-Tuckersharp minimizerSOSCLIKQlinear independence kink qualificationstrict complementary

Mathematics Subject Classification ID

Derivative-free methods and methods using generalized derivatives (90C56)

Related Items

Algorithms Based on Abs-Linearization for Non-smooth Optimization with PDE Constraints, On first and second order optimality conditions for abs-Normal NLP, Finite convergence of an active signature method to local minima of piecewise linear functions, Characterizing and Testing Subdifferential Regularity in Piecewise Smooth Optimization, On the abs-polynomial expansion of piecewise smooth functions, Nonsmooth optimization by successive abs-linearization in function spaces

Cites Work

• On Lipschitz optimization based on gray-box piecewise linearization
• Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• Nondifferentiable optimization and polynomial problems
• Solving piecewise linear systems in ABS-normal form
• Cubic regularization of Newton method and its global performance
• The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
• A \(\mathcal{VU}\)-algorithm for convex minimization
• Lexicographic differentiation of nonsmooth functions
• First- and second-order optimality conditions for piecewise smooth objective functions
• On stable piecewise linearization and generalized algorithmic differentiation
• Introduction to Piecewise Differentiable Equations
• Introduction to Nonsmooth Optimization
• Cubic overestimation and secant updating for unconstrained optimization ofC^{2, 1}functions
• Evaluating Derivatives
• On the Identification of Active Constraints
• On the Accurate Identification of Active Constraints
• Algorithmic differentiation for piecewise smooth functions: a case study for robust optimization
• Characterizing and Testing Subdifferential Regularity in Piecewise Smooth Optimization
• Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
• Optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item