Weak subgradient method for solving nonsmooth nonconvex optimization problems (Q5009157)

scientific article; zbMATH DE number 7383635

Language	Label	Description	Also known as
English	Weak subgradient method for solving nonsmooth nonconvex optimization problems	scientific article; zbMATH DE number 7383635

Statements

instance of

scholarly article

0 references

title

Weak subgradient method for solving nonsmooth nonconvex optimization problems (English)

0 references

0 references

0 references

0 references

19 August 2021

0 references

describes a project that uses

0 references

0 references

0 references

0 references

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1080/02331934.2020.1745205

0 references

cites work

Q5566712

0 references

Q5187067

0 references

Nonlinear Programming

0 references

Q3151174

0 references

Q4830373

0 references

The Efficiency of Subgradient Projection Methods for Convex Optimization, Part I: General Level Methods

0 references

The Efficiency of Subgradient Projection Methods for Convex Optimization, Part II: Implementations and Extensions

0 references

Convergence and efficiency of subgradient methods for quasiconvex minimization

0 references

Incremental Subgradient Methods for Nondifferentiable Optimization

0 references

Interior Gradient and Epsilon-Subgradient Descent Methods for Constrained Convex Minimization

0 references

Convergence Analysis of Deflected Conditional Approximate Subgradient Methods

0 references

Inexact subgradient methods for quasi-convex optimization problems

0 references

Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization

0 references

On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems.

0 references

The effect of deterministic noise in subgradient methods

0 references

Q3775322

0 references

Q4744875

0 references

Error stability properties of generalized gradient-type algorithms

0 references

Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods

0 references

Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming

0 references

A sharp augmented Lagrangian-based method in constrained non-convex optimization

0 references

On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian

0 references

On augmented Lagrangians for optimization problems with a single constraint

0 references

The modified subgradient algorithm based on feasible values

0 references

Q3182989

0 references

Stability and duality of nonconvex problems via augmented Lagrangian

0 references

Radial epiderivatives and set-valued optimization

0 references

A Nonlinear Cone Separation Theorem and Scalarization in Nonconvex Vector Optimization

0 references

A conic scalarization method in multi-objective optimization

0 references

On Weak Subdifferentials, Directional Derivatives, and Radial Epiderivatives for Nonconvex Functions

0 references

Optimality conditions in nonconvex optimization via weak subdifferentials

0 references

A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization

0 references

New limited memory bundle method for large-scale nonsmooth optimization

0 references

Restricted Step and Levenberg–Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization

0 references

A bundle-Newton method for nonsmooth unconstrained minimization

0 references

Globally convergent limited memory bundle method for large-scale nonsmooth optimization

0 references

A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization

0 references

Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization

0 references

Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization

0 references

A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems

0 references

A unified approach to global convergence of trust region methods for nonsmooth optimization

0 references

A trust region algorithm for minimization of locally Lipschitzian functions

0 references

Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control

0 references

On the choice of step size in subgradient optimization

0 references

Nonlinear programming methods in the presence of noise

0 references

Q3028166

0 references

Discrete gradient method: Derivative-free method for nonsmooth optimization

0 references

Introduction to Nonsmooth Optimization

0 references

Q5599348

0 references

A method for minimizing convex functions based on continuous approximations to the subdifferential

0 references

A generalization of Polyak's convergence result for subgradient optimization

0 references

Minimization of unsmooth functionals

0 references

Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search

0 references

A Method for Minimization of Quasidifferentiable Functions

0 references

Methods of descent for nondifferentiable optimization

0 references

Q4004158

0 references

Superlinearly convergent algorithm for min-max problems

0 references

Codifferential method for minimizing nonsmooth DC functions

0 references

An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization

0 references

Identifiers

zbMATH Open document ID

1476.90254

0 references

DOI

10.1080/02331934.2020.1745205

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5009157