Pages that link to "Item:Q4139993"
From MaRDI portal
The following pages link to Superlinearly convergent variable metric algorithms for general nonlinear programming problems (Q4139993):
Displaying 11 items.
- The linearization method (Q4729625) (← links)
- Second order methods for solving extremum problems form optimal linar regression design (Q4893714) (← links)
- On the Local Convergence of a Penalty-Function-Free SQP Method (Q4979789) (← links)
- The ESA NLP Solver WORHP (Q5270064) (← links)
- Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs (Q5501232) (← links)
- A modified SQP method and its global convergence (Q5899444) (← links)
- On the use of adjoint gradients for time-optimal control problems regarding a discrete control parameterization (Q6065501) (← links)
- YAM2: yet another library for the \(M_2\) variables using sequential quadratic programming (Q6104218) (← links)
- First- and second-order optimality conditions of nonsmooth sparsity multiobjective optimization via variational analysis (Q6541380) (← links)
- Sequential quadratic optimization for stochastic optimization with deterministic nonlinear inequality and equality constraints (Q6644844) (← links)
- A partially feasible Jacobi-type distributed SQO method for two-block general linearly constrained smooth optimization (Q6665306) (← links)
