Inexact subgradient methods for quasi-convex optimization problems
From MaRDI portal
Publication:2629635
Recommendations
- Stochastic subgradient method for quasi-convex optimization problems
- Efficiency of inexact fixed point quasiconvex subgradient method
- Abstract convergence theorem for quasi-convex optimization problems with applications
- Evaluation of fixed point quasiconvex subgradient method with computational inexactness
- Convergence rates of subgradient methods for quasi-convex optimization problems
Cites work
- scientific article; zbMATH DE number 1095224 (Why is no real title available?)
- scientific article; zbMATH DE number 3435272 (Why is no real title available?)
- scientific article; zbMATH DE number 2121575 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- scientific article; zbMATH DE number 3282977 (Why is no real title available?)
- scientific article; zbMATH DE number 3320765 (Why is no real title available?)
- A survey on the continuous nonlinear resource allocation problem
- Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming
- Calculating surrogate constraints
- Conditional subgradient optimization -- theory and applications
- Convergence analysis of deflected conditional approximate subgradient methods
- Convergence and efficiency of subgradient methods for quasiconvex minimization
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- Error bounds in mathematical programming
- Fractional Programming with Homogeneous Functions
- Generalized concavity
- Handbook of generalized convexity and generalized monotonicity
- Incremental subgradient methods for nondifferentiable optimization
- Interior Gradient and Epsilon-Subgradient Descent Methods for Constrained Convex Minimization
- Mean Value Property and Subdifferential Criteria for Lower Semicontinuous Functions
- On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian
- On properties of supporting and quasi-supporting vectors
- On the convergence of conditional -subgradient methods for convex programs and convex-concave saddle-point problems.
- Primal-dual subgradient methods for convex problems
- Quantized consensus
- Second-order Sufficiency and Quadratic Growth for Nonisolated Minima
- The effect of deterministic noise in subgradient methods
- Variational Analysis
- Weak Sharp Minima in Mathematical Programming
- Weak Sharp Minima: Characterizations and Sufficient Conditions
Cited in
(38)- Modified inexact Levenberg-Marquardt methods for solving nonlinear least squares problems
- An inexact modified subgradient algorithm for nonconvex optimization
- Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems
- Quasi-subgradient methods with Bregman distance for quasi-convex feasibility problems
- Quasi-convex feasibility problems: subgradient methods and convergence rates
- Sequential subspace optimization for quasar-convex optimization problems with inexact gradient
- On convergence rates of linearized proximal algorithms for convex composite optimization with applications
- Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions
- Optimality conditions for composite DC infinite programming problems
- Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization
- Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
- Convergence of inexact quasisubgradient methods with extrapolation
- Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces
- A modified inexact Levenberg-Marquardt method with the descent property for solving nonlinear equations
- An algorithm for quasiconvex equilibrium problems and asymptotically nonexpansive mappings: application to a Walras model with implicit supply-demand
- Multiple-sets split quasi-convex feasibility problems: adaptive subgradient methods with convergence guarantee
- Adaptive subgradient method for the split quasi-convex feasibility problems
- An inexact proximal method for quasiconvex minimization
- Fixed point quasiconvex subgradient method
- A primal-dual approach to inexact subgradient methods
- Optimality conditions for quasiconvex programming in terms of quasiconjugate functions
- A subgradient projection method for quasiconvex minimization
- Abstract convergence theorem for quasi-convex optimization problems with applications
- The effect of deterministic noise in subgradient methods
- Convergence rates of subgradient methods for quasi-convex optimization problems
- Characterizations of the solution set for non-essentially quasiconvex programming
- Abstract generalized epsilon-descent algorithm
- Stochastic subgradient method for quasi-convex optimization problems
- On a minimization problem of the maximum generalized eigenvalue: properties and algorithms
- Weak subgradient method for solving nonsmooth nonconvex optimization problems
- Linearized proximal algorithms with adaptive stepsizes for convex composite optimization with applications
- Efficiency of inexact fixed point quasiconvex subgradient method
- A subgradient method based on gradient sampling for solving convex optimization problems
- Optimality conditions and constraint qualifications for quasiconvex programming
- Riemannian linearized proximal algorithms for nonnegative inverse eigenvalue problem
- Evaluation of fixed point quasiconvex subgradient method with computational inexactness
- Weak Sharp Minima for Convex Infinite Optimization Problems in Normed Linear Spaces
- Conditional subgradient methods for constrained quasi-convex optimization problems
This page was built for publication: Inexact subgradient methods for quasi-convex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2629635)
