Pages that link to "Item:Q2629635"
From MaRDI portal
The following pages link to Inexact subgradient methods for quasi-convex optimization problems (Q2629635):
Displaying 35 items.
- An inexact proximal method for quasiconvex minimization (Q319853) (← links)
- Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization (Q721146) (← links)
- Convergence rates of subgradient methods for quasi-convex optimization problems (Q782917) (← links)
- Characterizations of the solution set for non-essentially quasiconvex programming (Q1686559) (← links)
- A primal-dual approach to inexact subgradient methods (Q1919096) (← links)
- The effect of deterministic noise in subgradient methods (Q1960191) (← links)
- Modified inexact Levenberg-Marquardt methods for solving nonlinear least squares problems (Q2007835) (← links)
- Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions (Q2010105) (← links)
- Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential (Q2022228) (← links)
- Quasi-convex feasibility problems: subgradient methods and convergence rates (Q2076909) (← links)
- Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems (Q2129140) (← links)
- Convergence of inexact quasisubgradient methods with extrapolation (Q2139278) (← links)
- Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces (Q2141725) (← links)
- An inexact modified subgradient algorithm for nonconvex optimization (Q2268922) (← links)
- Optimality conditions and constraint qualifications for quasiconvex programming (Q2278888) (← links)
- Fixed point quasiconvex subgradient method (Q2282530) (← links)
- Optimality conditions for composite DC infinite programming problems (Q2691286) (← links)
- Linearized proximal algorithms with adaptive stepsizes for convex composite optimization with applications (Q2694483) (← links)
- A Subgradient Method Based on Gradient Sampling for Solving Convex Optimization Problems (Q2795104) (← links)
- On convergence rates of linearized proximal algorithms for convex composite optimization with applications (Q2810547) (← links)
- Stochastic subgradient method for quasi-convex optimization problems (Q2812260) (← links)
- Adaptive subgradient method for the split quasi-convex feasibility problems (Q2836078) (← links)
- Weak Sharp Minima for Convex Infinite Optimization Problems in Normed Linear Spaces (Q4577185) (← links)
- Weak subgradient method for solving nonsmooth nonconvex optimization problems (Q5009157) (← links)
- Sequential Subspace Optimization for Quasar-Convex Optimization Problems with Inexact Gradient (Q5054156) (← links)
- Multiple-sets split quasi-convex feasibility problems: Adaptive subgradient methods with convergence guarantee (Q5088832) (← links)
- Abstract convergence theorem for quasi-convex optimization problems with applications (Q5228820) (← links)
- An algorithm for quasiconvex equilibrium problems and asymptotically nonexpansive mappings: application to a Walras model with implicit supply-demand (Q6057044) (← links)
- Riemannian linearized proximal algorithms for nonnegative inverse eigenvalue problem (Q6141535) (← links)
- A modified inexact Levenberg-Marquardt method with the descent property for solving nonlinear equations (Q6179880) (← links)
- Quasi-subgradient methods with Bregman distance for quasi-convex feasibility problems (Q6561482) (← links)
- Optimality conditions for quasiconvex programming in terms of quasiconjugate functions (Q6621993) (← links)
- A subgradient projection method for quasiconvex minimization (Q6624922) (← links)
- Abstract generalized epsilon-descent algorithm (Q6658462) (← links)
- On a minimization problem of the maximum generalized eigenvalue: properties and algorithms (Q6667699) (← links)
