A descent method for nonsmooth multiobjective optimization in Hilbert spaces
From MaRDI portal
Publication:6636793
DOI10.1007/s10957-024-02520-4MaRDI QIDQ6636793
Sebastian Peitz, Georg Müller, Konstantin Sonntag, Stefan Volkwein, Bennet Gebken
Publication date: 12 November 2024
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
nonsmooth optimizationmultiobjective optimizationobstacle problemPDE-constrained optimizationdescent methods in Hilbert spaces
Multi-objective and goal programming (90C29) Nonsmooth analysis (49J52) Control problems for functional-differential equations (34K35)
Cites Work
- Unnamed Item
- Unnamed Item
- A dynamic gradient approach to Pareto optimization with nonsmooth convex objective functions
- Contrôle dans les inéquations variationelles elliptiques
- How to differentiate the projection on a convex set in Hilbert space. Some applications to variational inequalities
- Steepest descent methods for multicriteria optimization.
- Theory and practice of finite elements.
- An efficient descent method for locally Lipschitz multiobjective optimization problems
- Efficient scalarization in multiobjective optimal control of a nonsmooth PDE
- Generalized derivatives for the solution operator of the obstacle problem
- Introduction to Nonsmooth Optimization
- On Nonsmooth Multiobjective Optimality Conditions with Generalized Convexities
- A Posteriori Error Estimator for Obstacle Problems
- A Nonderivative Version of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- Inertial forward–backward methods for solving vector optimization problems
- Truncated Nonsmooth Newton Multigrid Methods for Convex Minimization Problems
- Optimization with PDE Constraints
- Optimization and nonsmooth analysis
- Optimization of lipschitz continuous functions
- An Inexact Bundle Algorithm for Nonconvex Nonsmooth Minimization in Hilbert Space
- Gradients on Sets
- Computation of a Bouligand Generalized Derivative for the Solution Operator of the Obstacle Problem
- Strong Stationarity for Optimal Control of the Obstacle Problem with Control Constraints
- Adaptive Optimal Control of the Obstacle Problem
- Multicriteria Optimization
- Proximal Methods in Vector Optimization
- Variational inequalities
- On second-order optimality conditions for optimal control problems governed by the obstacle problem
- Convex analysis and monotone operator theory in Hilbert spaces
- Twenty years of continuous multiobjective optimization in the twenty-first century
- A note on the convergence of deterministic gradient sampling in nonsmooth optimization
This page was built for publication: A descent method for nonsmooth multiobjective optimization in Hilbert spaces