Nonconvex bundle method with application to a delamination problem
From MaRDI portal
Publication:316176
DOI10.1007/s10589-016-9834-0zbMath1353.90157arXiv1401.6807OpenAlexW2243232297MaRDI QIDQ316176
Dominikus Noll, Joachim Gwinner, Nina Ovcharova, Minh N. Dao
Publication date: 26 September 2016
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.6807
hemivariational inequalitydelaminationcomposite materiallower-\(C^1\) functionsnonconvex bundle methodupper-\(C^1\) functions
Applications of mathematical programming (90C90) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions, Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems, From the Fan-KKM principle to extended real-valued equilibria and to variational-hemivariational inequalities with application to nonmonotone contact problems, Noncoercive variational-hemivariational inequalities: existence, approximation by double regularization, and application to nonmonotone contact problems, Non-smooth optimization for robust control of infinite-dimensional systems, A survey of numerical methods for hemivariational inequalities with applications to contact mechanics, Coupling regularization and adaptive \(hp\)-BEM for the solution of a delamination problem, On the coupling of regularization techniques and the boundary element method for a hemivariational inequality modelling a delamination problem, A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective, Convergence analysis of numerical solutions for optimal control of variational-hemivariational inequalities, A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization, Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions, Nonsmooth bundle trust-region algorithm with applications to robust stability
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mathematical modeling of delamination and nonmonotone friction problems by hemivariational inequalities.
- Computing proximal points of nonconvex functions
- A bundle-Newton method for nonsmooth unconstrained minimization
- Approximate convexity and submonotonicity.
- Differentiability and semismoothness properties of integral functions and their applications
- Finite element method for hemivariational inequalities. Theory, methods and applications
- \(hp\)-FEM convergence for unilateral contact problems with Tresca friction in plane linear elastostatics
- Minimizing memory effects of a system
- Methods of descent for nondifferentiable optimization
- Nonsmooth optimization for multidisk \(H_\infty\) synthesis
- Robust eigenstructure clustering by non-smooth optimisation
- An aggregate subgradient method for nonsmooth convex minimization
- A hemivariational inequality in crack problems
- A Trust Region Spectral Bundle Method for Nonconvex Eigenvalue Optimization
- Submonotone Subdifferentials of Lipschitz Functions
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- Finite-element convergence for contact problems in plane linear elastostatics
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- A Proximal Bundle Method with Approximate Subgradient Linearizations
- Bundle Method for Non-Convex Minimization with Inexact Subgradients and Function Values
- Set-valued analysis
- A proximal bundle method for nonsmooth nonconvex functions with inexact information