A sharp augmented Lagrangian-based method in constrained non-convex optimization
From MaRDI portal
Publication:4631763
DOI10.1080/10556788.2018.1496431OpenAlexW2883550796MaRDI QIDQ4631763
Gurkan Ozturk, Refail Kasimbeyli, Adil M. Bagirov
Publication date: 23 April 2019
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2018.1496431
constrained optimizationnon-convex optimizationnon-smooth optimizationdiscrete gradient methodsharp augmented Lagrangianmodified subgradient algorithm
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)
Related Items (5)
A polyhedral conic functions based classification method for noisy data ⋮ Augmented Lagrangian based hybrid subgradient method for solving aircraft maintenance routing problem ⋮ On weak conjugacy, augmented Lagrangians and duality in nonconvex optimization ⋮ Weak subgradient method for solving nonsmooth nonconvex optimization problems ⋮ Revisiting augmented Lagrangian duals
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- Derivative-free methods for nonlinear programming with general lower-level constraints
- Optimality conditions in nonconvex optimization via weak subdifferentials
- On functions representable as a difference of convex functions
- A filled function method for constrained global optimization
- Discrete gradient method: Derivative-free method for nonsmooth optimization
- More test examples for nonlinear programming codes
- Test examples for nonlinear programming codes
- Handbook of test problems in local and global optimization
- Stability and duality of nonconvex problems via augmented Lagrangian
- Lagrange-type functions in constrained optimization
- Continuous subdifferential approximations and their applications
- Combined forecasts in portfolio optimization: a generalized approach
- On augmented Lagrangians for optimization problems with a single constraint
- Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming
- Global minimization using an augmented Lagrangian method with variable lower-level constraints
- An inexact modified subgradient algorithm for nonconvex optimization
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- Solving the quadratic assignment problem using F-MSG algorithm
- Numerical comparison of augmented Lagrangian algorithms for nonconvex problems
- On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian
- Piecewise partially separable functions and a derivative-free algorithm for large scale nonsmooth optimization
- Multiplier and gradient methods
- Introduction to Nonsmooth Optimization
- A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization
- A Redistributed Proximal Bundle Method for Nonconvex Optimization
- Constrained Bundle Methods for Upper Inexact Oracles with Application to Joint Chance Constrained Energy Problems
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- On Weak Subdifferentials, Directional Derivatives, and Radial Epiderivatives for Nonconvex Functions
- A Nonlinear Cone Separation Theorem and Scalarization in Nonconvex Vector Optimization
- Optimization and nonsmooth analysis
- Variational Analysis
- Trust Region Methods
- Pattern Search Algorithms for Bound Constrained Minimization
- Strictly Increasing Positively Homogeneous Functions with Application to Exact Penalization
- A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds
- Radial epiderivatives and set-valued optimization
- The modified subgradient algorithm based on feasible values
- An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
- A Simplex Method for Function Minimization
- Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
This page was built for publication: A sharp augmented Lagrangian-based method in constrained non-convex optimization
