Pages that link to "Item:Q1229804"
From MaRDI portal
The following pages link to A globally convergent method for nonlinear programming (Q1229804):
Displayed 50 items.
- A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity (Q556270) (← links)
- A globalization scheme for the generalized Gauss-Newton method (Q582820) (← links)
- Sequential penalty algorithm for nonlinear constrained optimization (Q597213) (← links)
- The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis (Q790580) (← links)
- The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. II. An efficient implementation with linear least squares subproblems (Q790581) (← links)
- The kidney model as an inverse problem (Q809915) (← links)
- A trust region method with a conic model for nonlinearly constrained optimization (Q854560) (← links)
- A simple feasible SQP algorithm for inequality constrained optimization (Q858743) (← links)
- A strongly convergent norm-relaxed method of strongly sub-feasible direction for optimization with nonlinear equality and inequality constraints (Q861188) (← links)
- Recursive quadratic programming algorithm that uses an exact augmented Lagrangian function (Q911471) (← links)
- On-line optimization of gas pipeline networks (Q922324) (← links)
- Vertical slot fishways: Mathematical modeling and optimal management (Q932726) (← links)
- A quadratically approximate framework for constrained optimization, global and local convergence (Q943517) (← links)
- Convergent stepsizes for constrained optimization algorithms (Q1061005) (← links)
- A quadratic approximation method for minimizing a class of quasidifferentiable functions (Q1063391) (← links)
- A globally convergent algorithm for nonlinearly constrained optimization problems (Q1071653) (← links)
- An active set RQP algorithm for engineering design optimization (Q1075123) (← links)
- On minimax eigenvalue problems via constrained optimization (Q1090242) (← links)
- Penalty functions, Newton's method, and quadratic programming (Q1093530) (← links)
- A sparse sequential quadratic programming algorithm (Q1095793) (← links)
- Control parametrization: a unified approach to optimal control problems with general constraints (Q1098400) (← links)
- Separation process optimization calculations (Q1099788) (← links)
- Numerical comparisons of nonlinear programming algorithms on serial and vector processors using automatic differentiation (Q1116896) (← links)
- Some numerical experience with a globally convergent algorithm for nonlinearly constrained optimization (Q1131824) (← links)
- A robust secant method for optimization problems with inequality constraints (Q1136347) (← links)
- Steplength algorithms for minimizing a class of nondifferentiable functions (Q1145472) (← links)
- Enlarging the region of convergence of Newton's method for constrained optimization (Q1149235) (← links)
- A globally convergent algorithm for exact penalty functions (Q1149884) (← links)
- Globally convergent methods for semi-infinite programming (Q1159954) (← links)
- A recursive quadratic programming algorithm for semi-infinite optimization problems (Q1169401) (← links)
- An algorithm for solving linearly constrained minimax problems (Q1169406) (← links)
- A least-distance programming procedure for minimization problems under linear constraints (Q1170113) (← links)
- Sequential quadratic programming for certain parameter identification problems (Q1181898) (← links)
- Successive linearization methods for large-scale nonlinear programming problems (Q1185122) (← links)
- An \(RQP\) algorithm using a differentiable exact penalty function for inequality constrained problems (Q1194855) (← links)
- Complete decomposition algorithm for nonconvex separable optimization problems and applications (Q1195824) (← links)
- A new successive quadratic programming algorithm (Q1210225) (← links)
- A quasi-Newton method for estimating the parameter in a nonlinear hyperbolic system (Q1283107) (← links)
- A reduced Hessian method for constrained optimization (Q1312087) (← links)
- Orthogonal and conjugate basis methods for solving equality constrained minimization problems (Q1312090) (← links)
- On a class fo hybrid methods for smooth constrained optimization (Q1321193) (← links)
- New minimax algorithm (Q1321280) (← links)
- Equality and inequality constrained optimization algorithms with convergent stepsizes (Q1321310) (← links)
- A recursive quadric programming algorithm that uses new nondifferentiable penalty functions (Q1333897) (← links)
- A two-parameter exact penalty function for nonlinear programming (Q1337206) (← links)
- New sequential quadratic programming algorithm with consistent subproblems (Q1368267) (← links)
- A global convergence theory for an active-trust-region algorithm for solving the general nonlinear programing problem. (Q1398662) (← links)
- Experimental complexity analysis of continuous constraint satisfaction problems. (Q1425278) (← links)
- A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity (Q1765848) (← links)
- Global convergence on an active set SQP for inequality constrained optimization (Q1779428) (← links)