Pages that link to "Item:Q2575251"
From MaRDI portal
The following pages link to Inexact proximal point algorithms and descent methods in optimization (Q2575251):
Displaying 16 items.
- An inexact proximal method for quasiconvex minimization (Q319853) (← links)
- An inexact proximal regularization method for unconstrained optimization (Q522090) (← links)
- A Lyusternik-Graves theorem for the proximal point method (Q694520) (← links)
- Descentwise inexact proximal algorithms for smooth optimization (Q1935582) (← links)
- An accelerated inexact proximal point algorithm for convex minimization (Q1937079) (← links)
- Local convergence analysis of a primal-dual method for bound-constrained optimization without SOSC (Q2032022) (← links)
- The developments of proximal point algorithms (Q2158107) (← links)
- An inexact and nonmonotone proximal method for smooth unconstrained minimization (Q2252253) (← links)
- Self-adaptive inexact proximal point methods (Q2479838) (← links)
- Uniformity and inexact version of a proximal method for metrically regular mappings (Q2642106) (← links)
- An inexact scalarization proximal point method for multiobjective quasiconvex minimization (Q2675734) (← links)
- Inexact Variants of the Proximal Point Algorithm without Monotonicity (Q4441938) (← links)
- Hybrid extragradient proximal algorithm coupled with parametric approximation and penalty/barrier methods (Q4916327) (← links)
- The indefinite proximal point algorithms for maximal monotone operators (Q5009166) (← links)
- On inexact versions of a quasi-equilibrium problem: a Cournot duopoly perspective (Q6497048) (← links)
- Finite convergence and sharp minima for quasi-equilibrium problems (Q6655788) (← links)
