scientific article; zbMATH DE number 169245
From MaRDI portal
Publication:4037898
Recommendations
- A globally convergent algorithm for nonlinearly constrained optimization problems
- Global convergence of a nonlinear programming method using convex approximations
- A global optimization method for nonconvex separable programming problems
- scientific article; zbMATH DE number 1437399
- A globally convergent version of a general recursive algorithm for nonlinear programming
- A globally convergent descent method for nonsmooth variational inequalities
- Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions
- A global linearization approach to solve nonlinear nonsmooth constrained programming problems
- OPTIMIZATION BASED GLOBALLY CONVERGENT METHODS FOR THE NONLINEAR COMPLEMENTARITY PROBLEM
- A global convergent method for nonlinear bilevel programming problems
Cited in
(11)- Global optimal algorithm for linear programming problems subjected to nonlinear constraints
- scientific article; zbMATH DE number 1464612 (Why is no real title available?)
- A generalized projection of strongly sub-feasible direction method with strong convergence for nonlinear constrained optimization
- A globally convergent algorithm for nonlinearly constrained optimization problems
- scientific article; zbMATH DE number 3868524 (Why is no real title available?)
- scientific article; zbMATH DE number 3894847 (Why is no real title available?)
- A two-stage feasible directions algorithm for nonlinear constrained optimization
- scientific article; zbMATH DE number 679675 (Why is no real title available?)
- Method of solution of nonlinear programming problems
- Norm-relaxed method of feasible directions for solving nonlinear programming problems
- A note on a globalization of Wilson-type optimization methods
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4037898)
