A descent method for nonsmooth multiobjective optimization in Hilbert spaces
From MaRDI portal
Recommendations
- An efficient descent method for locally Lipschitz multiobjective optimization problems
- scientific article; zbMATH DE number 3900525
- A continuous gradient-like dynamical approach to Pareto-optimization in Hilbert spaces
- Nonsmooth multiobjective programming with quasi-Newton methods
- scientific article; zbMATH DE number 7709325
Cites work
- scientific article; zbMATH DE number 5670835 (Why is no real title available?)
- A Posteriori Error Estimator for Obstacle Problems
- A dynamic gradient approach to Pareto optimization with nonsmooth convex objective functions
- A nonderivative version of the gradient sampling algorithm for nonsmooth nonconvex optimization
- A note on the convergence of deterministic gradient sampling in nonsmooth optimization
- Adaptive optimal control of the obstacle problem
- An Inexact Bundle Algorithm for Nonconvex Nonsmooth Minimization in Hilbert Space
- An efficient descent method for locally Lipschitz multiobjective optimization problems
- Computation of a Bouligand generalized derivative for the solution operator of the obstacle problem
- Contrôle dans les inéquations variationelles elliptiques
- Convex analysis and monotone operator theory in Hilbert spaces
- Efficient scalarization in multiobjective optimal control of a nonsmooth PDE
- Generalized derivatives for the solution operator of the obstacle problem
- Gradients on sets
- How to differentiate the projection on a convex set in Hilbert space. Some applications to variational inequalities
- Inertial forward–backward methods for solving vector optimization problems
- Infinite dimensional analysis. A hitchhiker's guide.
- Introduction to nonsmooth optimization. Theory, practice and software
- Multicriteria Optimization
- On Nonsmooth Multiobjective Optimality Conditions with Generalized Convexities
- On second-order optimality conditions for optimal control problems governed by the obstacle problem
- Optimization and nonsmooth analysis
- Optimization of lipschitz continuous functions
- Optimization with PDE Constraints
- Proximal Methods in Vector Optimization
- Steepest descent methods for multicriteria optimization.
- Strong stationarity for optimal control of the obstacle problem with control constraints
- Theory and practice of finite elements.
- Truncated nonsmooth Newton multigrid methods for convex minimization problems
- Twenty years of continuous multiobjective optimization in the twenty-first century
- Variational inequalities
This page was built for publication: A descent method for nonsmooth multiobjective optimization in Hilbert spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6636793)
