Pages that link to "Item:Q4764581"
From MaRDI portal
The following pages link to Full convergence of the steepest descent method with inexact line searches (Q4764581):
Displaying 50 items.
- Enlargement of monotone vector fields and an inexact proximal point method for variational inequalities in Hadamard manifolds (Q328456) (← links)
- Global convergence of a proximal linearized algorithm for difference of convex functions (Q331993) (← links)
- The extragradient method for solving variational inequalities in the presence of computational errors (Q438778) (← links)
- A class of Fejér convergent algorithms, approximate resolvents and the hybrid proximal-extragradient method (Q467410) (← links)
- A steepest descent-like method for variable order vector optimization problems (Q467437) (← links)
- Legendre transform and applications to finite and infinite optimization (Q505632) (← links)
- Convergence of the projected gradient method for quasiconvex multiobjective optimization (Q555040) (← links)
- IQC analysis and synthesis via nonsmooth optimization (Q864474) (← links)
- On the convergence of a new hybrid projection algorithm (Q882531) (← links)
- Convergence of direct methods for paramonotone variational inequalities (Q975354) (← links)
- Convergence of a projected gradient method variant for quasiconvex objectives (Q992826) (← links)
- Proximal point algorithm with Schur decomposition on the cone of symmetric semidefinite positive matrices (Q1022951) (← links)
- Subgradient algorithm on Riemannian manifolds (Q1264990) (← links)
- On the projected subgradient method for nonsmooth convex optimization in a Hilbert space (Q1290597) (← links)
- An interior point method with Bregman functions for the variational inequality problem with paramonotone operators (Q1290609) (← links)
- Descent methods with linesearch in the presence of perturbations (Q1360171) (← links)
- Some convergence properties of descent methods (Q1372548) (← links)
- A relaxed projection method for solving multiobjective optimization problems (Q1752157) (← links)
- Unconstrained steepest descent method for multicriteria optimization on Riemannian manifolds (Q1762393) (← links)
- A steepest descent method for vector optimization (Q1765484) (← links)
- Nonsmooth nonconvex global optimization in a Banach space with a basis (Q1767923) (← links)
- Two facts on the convergence of the Cauchy algorithm (Q1841573) (← links)
- A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems (Q2046554) (← links)
- Limited-memory common-directions method for large-scale optimization: convergence, parallelization, and distributed optimization (Q2088969) (← links)
- Linear convergence of a nonmonotone projected gradient method for multiobjective optimization (Q2114598) (← links)
- On inexact projected gradient methods for solving variable vector optimization problems (Q2138300) (← links)
- Full convergence of an approximate projection method for nonsmooth variational inequalities (Q2228645) (← links)
- The self regulation problem as an inexact steepest descent method for multicriteria optimization (Q2256314) (← links)
- Iteration-complexity and asymptotic analysis of steepest descent method for multiobjective optimization on Riemannian manifolds (Q2302754) (← links)
- Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems (Q2329657) (← links)
- A subgradient method for multiobjective optimization (Q2377160) (← links)
- Inexact projected gradient method for vector optimization (Q2377166) (← links)
- Newton-like methods for efficient solutions in vector optimization (Q2377172) (← links)
- On the steplength selection in gradient methods for unconstrained optimization (Q2422865) (← links)
- Steepest descent method with a generalized Armijo search for quasiconvex functions on Riemannian manifolds (Q2474954) (← links)
- Convex- and monotone-transformable mathematical programming problems and a proximal-like point method (Q2505560) (← links)
- Double-regularization proximal methods, with complementarity applications (Q2506183) (← links)
- Convergence of the steepest descent method for minimizing quasiconvex functions (Q2564182) (← links)
- Inexact gradient projection method with relative error tolerance (Q2696906) (← links)
- On Weak and Strong Convergence of the Projected Gradient Method for Convex Optimization in Real Hilbert Spaces (Q2805982) (← links)
- Optimal fixed-levels control for nonlinear systems with quadratic cost-functionals (Q2830299) (← links)
- Blind deconvolution by a Newton method on the non-unitary hypersphere (Q2847023) (← links)
- On perturbed steepest descent methods with inexact line search for bilevel convex optimization (Q3112499) (← links)
- On the convergence of the projected gradient method for vector optimization (Q3112500) (← links)
- Algorithms for quasiconvex minimization (Q3112506) (← links)
- A relaxed projection method for finite-dimensional equilibrium problems (Q3112510) (← links)
- A Strongly Convergent Method for Nonsmooth Convex Minimization in Hilbert Spaces (Q3114576) (← links)
- Steepest descent methods for critical points in vector optimization problems (Q3143359) (← links)
- First Order Methods for Optimization on Riemannian Manifolds (Q3300552) (← links)
- Convergence of a nonmonotone projected gradient method for nonconvex multiobjective optimization (Q3383208) (← links)
