An inner approximation method incorporating with a penalty function method for a reverse convex programming problem
From MaRDI portal
Publication:697546
Recommendations
- Inner approximation method for a reverse convex programming problem
- Penalty function methods and a duality gap for invex optimization problems
- An approximate penalty method with descent for convex optimization problems
- scientific article; zbMATH DE number 4068624
- Application of the penalty function method to generalized convex programs
- A penalized interior point approach for constrained nonlinear programming
- The Exact l 1 Penalty Function Method for Constrained Nonsmooth Invex Optimization Problems
- Penalty function method and regularization in the analysis of improper convex programs
- An interior-point \(\ell_{\frac{1}{2}}\)-penalty method for inequality constrained nonlinear optimization
- scientific article; zbMATH DE number 5524381
Cites work
- scientific article; zbMATH DE number 417962 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- Convex analysis and global optimization
- Handbook of global optimization
- Inner approximation method for a reverse convex programming problem
- Optimization on low rank nonconvex structures
- Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications
Cited in
(2)
This page was built for publication: An inner approximation method incorporating with a penalty function method for a reverse convex programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q697546)
