Convex approximation methods for practical optimization.
From MaRDI portal
Recommendations
- A combined convex approximation -- interior point approach for large scale nonlinear programming
- Global convergence of a nonlinear programming method using convex approximations
- scientific article; zbMATH DE number 775098
- The method of moving asymptotes—a new method for structural optimization
- A moving asymptotes algorithm using new local convex approximation methods with explicit solutions
Cited in
(13)- A class of globally convergent optimization methods based on conservative convex separable approximations
- Recent advances in structural optimization
- A stabilization procedure by line-search computation for first order approximation strategies in structural optimization
- scientific article; zbMATH DE number 2051095 (Why is no real title available?)
- A moving asymptotes algorithm using new local convex approximation methods with explicit solutions
- scientific article; zbMATH DE number 195139 (Why is no real title available?)
- Convex Parametric Programming in Abstract Spaces
- scientific article; zbMATH DE number 775098 (Why is no real title available?)
- The Evolution of Methods of Convex Optimization
- scientific article; zbMATH DE number 2218047 (Why is no real title available?)
- Global convergence of a nonlinear programming method using convex approximations
- A combined convex approximation -- interior point approach for large scale nonlinear programming
- Numerical instabilities and convergence control for convex approximation methods
This page was built for publication: Convex approximation methods for practical optimization.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4789849)
