Pages that link to "Item:Q5948218"
From MaRDI portal
The following pages link to Global convergence of a nonlinear programming method using convex approximations (Q5948218):
Displaying 17 items.
- Solving stress constrained problems in topology and material optimization (Q381807) (← links)
- A topology Nash game for tumoral antiangiogenesis (Q438518) (← links)
- Global and local convergence of a penalty-free method for nonlinear programming (Q493442) (← links)
- Numerical instabilities and convergence control for convex approximation methods (Q623934) (← links)
- Global and local convergence of a class of penalty-free-type methods for nonlinear programming (Q693410) (← links)
- The convergence of global search algorithm in the problem of convex maximization on admissible set (Q1589148) (← links)
- Robust truss topology optimization via semidefinite programming with complementarity constraints: a difference-of-convex programming approach (Q1616936) (← links)
- A scaled three-term conjugate gradient method for large-scale unconstrained optimization problem (Q2009756) (← links)
- Variations and extension of the convex-concave procedure (Q2358020) (← links)
- A new method of moving asymptotes for large-scale linearly equality-constrained minimization (Q2431059) (← links)
- A new method of moving asymptotes for large-scale unconstrained optimization (Q2518690) (← links)
- Global convergence of a curvilinear search for non-convex optimization (Q2691895) (← links)
- An algorithm for the topology optimization of geometrically nonlinear structures (Q2952527) (← links)
- Numerical studies on the globally convergent convexification algorithm in 2D (Q3425195) (← links)
- A globally convergent version of a general recursive algorithm for nonlinear programming (Q3741433) (← links)
- (Q4037898) (← links)
- Very large scale optimization by sequential convex programming (Q4673327) (← links)
