Proximal gradient method for convex multiobjective optimization problems without Lipschitz continuous gradients
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- scientific article; zbMATH DE number 477581 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 908535 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems
- A proximal gradient method with Bregman distance in multi-objective optimization
- A proximal gradient splitting method for solving convex vector optimization problems
- Accelerated diagonal steepest descent method for unconstrained multiobjective optimization
- An accelerated proximal gradient method for multiobjective optimization
- An inexact scalarization proximal point method for multiobjective quasiconvex minimization
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Benchmarking optimization software with performance profiles.
- Complexity of gradient descent for multiobjective optimization
- Compressed sensing
- Convergence rates analysis of a multiobjective proximal gradient method
- Convex Analysis
- First-order methods in optimization
- From error bounds to the complexity of first-order descent methods for convex functions
- Incremental majorization-minimization optimization with application to large-scale machine learning
- Inertial forward–backward methods for solving vector optimization problems
- Introductory lectures on convex optimization. A basic course.
- Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
- Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems
- New merit functions for multiobjective optimization and their properties
- Nonmonotone line searches for unconstrained multiobjective optimization problems
- On the convergence of the forward-backward splitting method with linesearches
- Production structure and international trade
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Proximal gradient methods for multiobjective optimization and their applications
- Signal Recovery by Proximal Forward-Backward Splitting
- The proximal point method for locally Lipschitz functions in multiobjective optimization with application to the compromise problem
- Variational methods in partially ordered spaces
Cited in
(4)- An exact penalty method with nonmonotone line search and rapid infeasibility detection for constrained multiobjective optimization: application in supervised machine learning
- A proximal gradient method with an explicit line search for multiobjective optimization
- First and second order optimality conditions for nonsmooth multiobjective problems with equilibrium constraints
- Cubic regularization technique of the Newton method for vector optimization
This page was built for publication: Proximal gradient method for convex multiobjective optimization problems without Lipschitz continuous gradients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7005454)
