Lagrangian regularization approach to constrained optimization problems
From MaRDI portal
Recommendations
- A globally convergent regularized interior point method for constrained optimization
- On constrained optimization with nonconvex regularization
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- Smoothing approximation to \(l_{1}\) exact penalty function for constrained optimization problems
- Regularized gap function as penalty term for constrained minimization problems
Cites work
- Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming
- Convex Analysis
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- Modified barrier functions (theory and methods)
- On the convergence of the exponential multiplier method for convex programming
Cited in
(7)- Lagrange-type functions in constrained optimization
- Boundedness of the inverse of a regularized Jacobian matrix in constrained optimization and applications
- On constrained optimization with nonconvex regularization
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- On High-order Model Regularization for Constrained Optimization
- A Tikhonov regularization parameter approach for solving Lagrange constrained optimization problems
- Using conical regularization in calculating Lagrangian estimates in quadratic optimization problems
This page was built for publication: Lagrangian regularization approach to constrained optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703420)