Pages that link to "Item:Q2570027"

The following pages link to Algorithms for the quasiconvex feasibility problem (Q2570027):

Displaying 17 items.

• Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods (Q494329) (← links)
• A new hybrid iterative algorithm for variational inequalities (Q969150) (← links)
• Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions (Q2010105) (← links)
• Acceleration procedure for special classes of multi-extremal problems (Q2010137) (← links)
• Quasi-convex feasibility problems: subgradient methods and convergence rates (Q2076909) (← links)
• Strong subdifferentials: theory and applications in nonconvex optimization (Q2079689) (← links)
• An extension of the proximal point algorithm beyond convexity (Q2114582) (← links)
• Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems (Q2129140) (← links)
• Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces (Q2141725) (← links)
• Fixed point quasiconvex subgradient method (Q2282530) (← links)
• A subgradient method for multiobjective optimization (Q2377160) (← links)
• A subgradient method for equilibrium problems involving quasiconvex bifunctions (Q2661523) (← links)
• Adaptive subgradient method for the split quasi-convex feasibility problems (Q2836078) (← links)
• Algorithms for quasiconvex minimization (Q3112506) (← links)
• Multiple-sets split quasi-convex feasibility problems: Adaptive subgradient methods with convergence guarantee (Q5088832) (← links)
• Incremental Quasi-Subgradient Method for Minimizing Sum of Geodesic Quasi-Convex Functions on Riemannian Manifolds with Applications (Q5861980) (← links)
• Existence and uniqueness of maximal elements for preference relations: variational approach (Q6050161) (← links)