An inexact modified subgradient algorithm for nonconvex optimization
From MaRDI portal
Publication:2268922
Recommendations
- An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization
- A subgradient method for unconstrained nonconvex nonsmooth optimization
- Inexact subgradient methods for quasi-convex optimization problems
- Subgradient method for nonconvex nonsmooth optimization
- scientific article; zbMATH DE number 2221956
- Modified subgradient extragradient algorithms for variational inequality problems and fixed point problems
- Modified inertial subgradient extragradient algorithms for variational inequalities and fixed point problems
- An improved subgradient method for constrained nondifferentiable optimization
- A modified subgradient algorithm for Lagrangean relaxation
- Incremental subgradient methods for nondifferentiable optimization
Cites work
- A convergent variant of the Nelder--Mead algorithm
- A generalized subgradient method with relaxation step
- A variable target value method for nondifferentiable optimization
- An update rule and a convergence result for a penalty function method
- Approximate subgradient methods for nonlinearly constrained network flow problems
- Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming
- Computational method for time-optimal switching control
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
- Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
- Global minimization using an augmented Lagrangian method with variable lower-level constraints
- Handbook of test problems in local and global optimization
- scientific article; zbMATH DE number 781821 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- scientific article; zbMATH DE number 2221956 (Why is no real title available?)
- Incremental subgradient methods for nondifferentiable optimization
- Nonlinear Lagrange duality theorems and penalty function methods in continuous optimization
- On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian
- On the absence of duality gap for Lagrange-type functions
- On the choice of step size in subgradient optimization
- The Lagrangian globalization method for nonsmooth constrained equations
Cited in
(25)- An improved subgradient method for constrained nondifferentiable optimization
- A hybrid epigraph directions method for nonsmooth and nonconvex constrained optimization via generalized augmented Lagrangian duality and a genetic algorithm
- An inexact modified subgradient algorithm for primal-dual problems via augmented Lagrangians
- An explicit extragradient algorithm for equilibrium problems on Hadamard manifolds
- On weak conjugacy, augmented Lagrangians and duality in nonconvex optimization
- A primal dual modified subgradient algorithm with sharp Lagrangian
- A flexible inexact-restoration method for constrained optimization
- Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization
- A modified BFGS bundle algorithm based on approximate subgradients
- A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods
- On primal convergence for augmented Lagrangian duality
- A new scalarization and numerical method for constructing the weak Pareto front of multi-objective optimization problems
- An extragradient algorithm for strongly pseudomonotone equilibrium problems on Hadamard manifolds
- Modified Active Subspaces Using the Average of Gradients
- A sharp augmented Lagrangian-based method in constrained non-convex optimization
- Interior epigraph directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality
- A primal–dual penalty method via rounded weighted-ℓ1 Lagrangian duality
- The modified subgradient algorithm based on feasible values
- The exact penalty map for nonsmooth and nonconvex optimization
- A modified subgradient algorithm for Lagrangean relaxation
- Viscosity-type extragradient algorithm for finding common solution of pseudomonotone equilibrium problem and fixed point problem in Hilbert space
- Optimization over the efficient set of multi-objective convex optimal control problems
- An augmented penalty function method with penalty parameter updates for nonconvex optimization
- Convergence analysis of primal-dual augmented Lagrangian methods and duality theory
- On asymptotic Lagrangian duality for nonsmooth optimization
This page was built for publication: An inexact modified subgradient algorithm for nonconvex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2268922)
