On augmented Lagrangians for optimization problems with a single constraint
From MaRDI portal
Publication:1771069
DOI10.1023/B:JOGO.0000015309.88480.2BzbMATH Open1058.90061OpenAlexW2076744267MaRDI QIDQ1771069FDOQ1771069
A. M. Rubinov, Rafail N. Gasimov
Publication date: 7 April 2005
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:jogo.0000015309.88480.2b
Optimality conditions and duality in mathematical programming (90C46) Nonlinear programming (90C30) Duality theory (optimization) (49N15)
Cited In (30)
- Optimality conditions via weak subdifferentials in reflexive Banach spaces
- A conic scalarization method in multi-objective optimization
- On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian
- A sharp augmented Lagrangian-based method in constrained non-convex optimization
- Title not available (Why is that?)
- Stochastic subgradient algorithm for nonsmooth nonconvex optimization
- A nonlinear programming technique to compute a~tight~lower bound for the real structured singular value
- Unified duality theory for constrained extremum problems. II: Special duality schemes
- Existence and characterization theorems in nonconvex vector optimization
- Radial epiderivatives and set-valued optimization
- Some notes on weak subdifferential
- A primal dual modified subgradient algorithm with sharp Lagrangian
- Saddle point and exact penalty representation for generalized proximal Lagrangians
- Saddle points theory of two classes of augmented Lagrangians and its applications to generalized semi-infinite programming
- Title not available (Why is that?)
- Weak-subdifferentials for vector functions and applications to multiobjective semi-infinite optimization problems
- On weak conjugacy, augmented Lagrangians and duality in nonconvex optimization
- Existence of augmented Lagrange multipliers: reduction to exact penalty functions and localization principle
- Separation theorems for nonconvex sets and application in optimization
- The modified subgradient algorithm based on feasible values
- An inexact modified subgradient algorithm for primal-dual problems via augmented Lagrangians
- Optimality conditions in nonconvex optimization via weak subdifferentials
- Feasible modified subgradient method for solving the thermal unit commitment problem as a new approach
- Solving unit commitment problem using modified subgradient method combined with simulated annealing algorithm
- A nonlinear programming approach for the sliding mode control design
- Conic Scalarization Method in Multiobjective Optimization and Relations with Other Scalarization Methods
- Combined forecasts in portfolio optimization: a generalized approach
- Weak subgradient method for solving nonsmooth nonconvex optimization problems
- A primal–dual penalty method via rounded weighted-ℓ1 Lagrangian duality
- Weak stability and strong duality of a class of nonconvex infinite programs via augmented Lagrangian
This page was built for publication: On augmented Lagrangians for optimization problems with a single constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1771069)