An inexact modified subgradient algorithm for nonconvex optimization
From MaRDI portal
Publication:2268922
DOI10.1007/s10589-008-9168-7zbMath1208.90137OpenAlexW2057287114WikidataQ58048465 ScholiaQ58048465MaRDI QIDQ2268922
Musa A. Mammadov, Regina Sandra Burachik, C. Yalçın Kaya
Publication date: 15 March 2010
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://unisa.alma.exlibrisgroup.com/view/delivery/61USOUTHAUS_INST/12142893350001831
Related Items
A primal–dual penalty method via rounded weighted-ℓ1 Lagrangian duality ⋮ Optimization over the efficient set of multi-objective convex optimal control problems ⋮ Viscosity-type extragradient algorithm for finding common solution of pseudomonotone equilibrium problem and fixed point problem in Hilbert space ⋮ Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization ⋮ An inexact modified subgradient algorithm for primal-dual problems via augmented Lagrangians ⋮ Unnamed Item ⋮ On weak conjugacy, augmented Lagrangians and duality in nonconvex optimization ⋮ A hybrid epigraph directions method for nonsmooth and nonconvex constrained optimization via generalized augmented Lagrangian duality and a genetic algorithm ⋮ An augmented penalty function method with penalty parameter updates for nonconvex optimization ⋮ A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods ⋮ 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 ⋮ An explicit extragradient algorithm for equilibrium problems on Hadamard manifolds ⋮ A primal dual modified subgradient algorithm with sharp Lagrangian ⋮ On primal convergence for augmented Lagrangian duality ⋮ A new scalarization and numerical method for constructing the weak Pareto front of multi-objective optimization problems ⋮ The exact penalty map for nonsmooth and nonconvex optimization ⋮ A flexible inexact-restoration method for constrained optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A convergent variant of the Nelder--Mead algorithm
- On the choice of step size in subgradient optimization
- Handbook of test problems in local and global optimization
- Computational method for time-optimal switching control
- Nonlinear Lagrange duality theorems and penalty function methods in continuous optimization
- On the absence of duality gap for Lagrange-type functions
- Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming
- A generalized subgradient method with relaxation step
- Global minimization using an augmented Lagrangian method with variable lower-level constraints
- A variable target value method for nondifferentiable optimization
- An update rule and a convergence result for a penalty function method
- On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian
- Approximate subgradient methods for nonlinearly constrained network flow problems
- The Lagrangian globalization method for nonsmooth constrained equations
- Incremental Subgradient Methods for Nondifferentiable Optimization
- Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
- Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
