A sharp augmented Lagrangian-based method in constrained non-convex optimization
From MaRDI portal
Recommendations
- The global convergence of augmented Lagrangian methods based on NCP function in constrained nonconvex optimization
- Nonconvex and nonsmooth optimization with generalized orthogonality constraints: an approximate augmented Lagrangian method
- An alternating augmented Lagrangian method for constrained nonconvex optimization
- Global minimization using an augmented Lagrangian method with variable lower-level constraints
- Augmented Lagrangian method with alternating constraints for nonlinear optimization problems
Cites work
- A filled function method for constrained global optimization
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds
- A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization
- A Nonlinear Cone Separation Theorem and Scalarization in Nonconvex Vector Optimization
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
- A redistributed proximal bundle method for nonconvex optimization
- A Simplex Method for Function Minimization
- An inexact modified subgradient algorithm for nonconvex optimization
- An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
- Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
- Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- Combined forecasts in portfolio optimization: a generalized approach
- Constrained bundle methods for upper inexact oracles with application to joint chance constrained energy problems
- Continuous subdifferential approximations and their applications
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- Derivative-free methods for nonlinear programming with general lower-level constraints
- Discrete gradient method: Derivative-free method for nonsmooth optimization
- 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 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 5617354 (Why is no real title available?)
- scientific article; zbMATH DE number 53965 (Why is no real title available?)
- scientific article; zbMATH DE number 3309655 (Why is no real title available?)
- scientific article; zbMATH DE number 2221956 (Why is no real title available?)
- Introduction to nonsmooth optimization. Theory, practice and software
- Lagrange-type functions in constrained optimization
- More test examples for nonlinear programming codes
- Multiplier and gradient methods
- Numerical comparison of augmented Lagrangian algorithms for nonconvex problems
- On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- On augmented Lagrangians for optimization problems with a single constraint
- On functions representable as a difference of convex functions
- On Weak Subdifferentials, Directional Derivatives, and Radial Epiderivatives for Nonconvex Functions
- Optimality conditions in nonconvex optimization via weak subdifferentials
- Optimization and nonsmooth analysis
- Pattern Search Algorithms for Bound Constrained Minimization
- Piecewise partially separable functions and a derivative-free algorithm for large scale nonsmooth optimization
- Radial epiderivatives and set-valued optimization
- Solving the quadratic assignment problem using F-MSG algorithm
- Stability and duality of nonconvex problems via augmented Lagrangian
- Strictly Increasing Positively Homogeneous Functions with Application to Exact Penalization
- Test examples for nonlinear programming codes
- The modified subgradient algorithm based on feasible values
- Trust Region Methods
- Variational Analysis
Cited in
(18)- A hybrid epigraph directions method for nonsmooth and nonconvex constrained optimization via generalized augmented Lagrangian duality and a genetic algorithm
- Global minimization using an augmented Lagrangian method with variable lower-level constraints
- Revisiting augmented Lagrangian duals
- On weak conjugacy, augmented Lagrangians and duality in nonconvex optimization
- A polyhedral conic functions based classification method for noisy data
- Augmented Lagrangian based hybrid subgradient method for solving aircraft maintenance routing problem
- An augmented Lagrangian method for non-Lipschitz nonconvex programming
- Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization
- Weak subgradient method for solving nonsmooth nonconvex optimization problems
- An alternating augmented Lagrangian method for constrained nonconvex optimization
- Nonconvex Lagrangian-based optimization: monitoring schemes and global convergence
- An augmented Lagrangian method for optimization problems with structured geometric constraints
- Dislocation hyperbolic augmented Lagrangian algorithm for nonconvex optimization
- Stochastic subgradient algorithm for nonsmooth nonconvex optimization
- Convergence analysis of primal-dual augmented Lagrangian methods and duality theory
- Enhancing sharp augmented Lagrangian methods with smoothing techniques for nonlinear programming
- A new mathematical model and solution method for the asymmetric traveling salesman problem with replenishment arcs
- The augmented Lagrangian methods: overview and recent advances
This page was built for publication: A sharp augmented Lagrangian-based method in constrained non-convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4631763)
