Inexact subgradient methods for quasi-convex optimization problems

DOI10.1016/j.ejor.2014.05.017zbMath1357.90116DBLPjournals/eor/HuYS15OpenAlexW2055326668WikidataQ58028356 ScholiaQ58028356MaRDI QIDQ2629635

Chee-Khian Sim, Yao-Hua Hu, Xiao Qi Yang

Publication date: 6 July 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://researchportal.port.ac.uk/portal/en/publications/inexact-subgradient-methods-for-quasiconvex-optimization-problems(59b11da9-9fd3-491e-9455-3be7184c210a).html

zbMATH Keywords

noisesubgradient methodweak sharp minimaquasi-convex optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56)

Related Items (24)

Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems ⋮ Convergence of inexact quasisubgradient methods with extrapolation ⋮ Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces ⋮ Weak Sharp Minima for Convex Infinite Optimization Problems in Normed Linear Spaces ⋮ Multiple-sets split quasi-convex feasibility problems: Adaptive subgradient methods with convergence guarantee ⋮ Characterizations of the solution set for non-essentially quasiconvex programming ⋮ An algorithm for quasiconvex equilibrium problems and asymptotically nonexpansive mappings: application to a Walras model with implicit supply-demand ⋮ Riemannian linearized proximal algorithms for nonnegative inverse eigenvalue problem ⋮ A modified inexact Levenberg-Marquardt method with the descent property for solving nonlinear equations ⋮ Optimality conditions for composite DC infinite programming problems ⋮ Linearized proximal algorithms with adaptive stepsizes for convex composite optimization with applications ⋮ Modified inexact Levenberg-Marquardt methods for solving nonlinear least squares problems ⋮ Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions ⋮ Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential ⋮ Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization ⋮ Optimality conditions and constraint qualifications for quasiconvex programming ⋮ A Subgradient Method Based on Gradient Sampling for Solving Convex Optimization Problems ⋮ Fixed point quasiconvex subgradient method ⋮ On Convergence Rates of Linearized Proximal Algorithms for Convex Composite Optimization with Applications ⋮ Abstract convergence theorem for quasi-convex optimization problems with applications ⋮ Adaptive subgradient method for the split quasi-convex feasibility problems ⋮ Quasi-convex feasibility problems: subgradient methods and convergence rates ⋮ Convergence rates of subgradient methods for quasi-convex optimization problems ⋮ Weak subgradient method for solving nonsmooth nonconvex optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Primal-dual subgradient methods for convex problems
• Handbook of generalized convexity and generalized monotonicity
• Generalized concavity
• Conditional subgradient optimization -- theory and applications
• Error bounds in mathematical programming
• On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems.
• Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming
• On properties of supporting and quasi-supporting vectors
• The effect of deterministic noise in subgradient methods
• A survey on the continuous nonlinear resource allocation problem
• On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian
• Quantized consensus
• Incremental Subgradient Methods for Nondifferentiable Optimization
• Weak Sharp Minima in Mathematical Programming
• Calculating surrogate constraints
• Variational Analysis
• Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
• Fractional Programming with Homogeneous Functions
• Mean Value Property and Subdifferential Criteria for Lower Semicontinuous Functions
• Second-order Sufficiency and Quadratic Growth for Nonisolated Minima
• Weak Sharp Minima: Characterizations and Sufficient Conditions
• Convergence Analysis of Deflected Conditional Approximate Subgradient Methods
• Interior Gradient and Epsilon-Subgradient Descent Methods for Constrained Convex Minimization
• Convergence and efficiency of subgradient methods for quasiconvex minimization

This page was built for publication: Inexact subgradient methods for quasi-convex optimization problems