Pages that link to "Item:Q1762409"
From MaRDI portal
The following pages link to Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints (Q1762409):
Displaying 22 items.
- An inexact proximal method for quasiconvex minimization (Q319853) (← links)
- Interior proximal methods for quasiconvex optimization (Q427358) (← links)
- A double projection algorithm for quasimonotone variational inequalities in Banach spaces (Q824799) (← links)
- A scalarization proximal point method for quasiconvex multiobjective minimization (Q905757) (← links)
- An interior point method for quadratic programs based on conjugate projected gradients (Q1260618) (← links)
- An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities (Q1924060) (← links)
- Weak convergence of iterative methods for solving quasimonotone variational inequalities (Q2023662) (← links)
- A projection-like method for quasimonotone variational inequalities without Lipschitz continuity (Q2080832) (← links)
- On strongly quasiconvex functions: existence results and proximal point algorithms (Q2116608) (← links)
- An infeasible projection type algorithm for nonmonotone variational inequalities (Q2118960) (← links)
- Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces (Q2141725) (← links)
- A projection algorithm for non-monotone variational inequalities (Q2174926) (← links)
- A proximal interior point algorithm with applications to image processing (Q2203368) (← links)
- A double projection method for solving variational inequalities without monotonicity (Q2515068) (← links)
- An inexact scalarization proximal point method for multiobjective quasiconvex minimization (Q2675734) (← links)
- Relaxed-inertial proximal point type algorithms for quasiconvex minimization (Q2689858) (← links)
- An infeasible interior proximal method for convex programming problems with linear constraints (Q2764699) (← links)
- An inexact algorithm with proximal distances for variational inequalities (Q4579889) (← links)
- (Q5042653) (← links)
- An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels (Q5228821) (← links)
- Variance reduced forward-reflected-backward algorithm for solving nonconvex finite-sum mixed variational inequalities (Q6574056) (← links)
- Extragradient type projection algorithm for solving quasimonotone variational inequalities (Q6606316) (← links)
