Pages that link to "Item:Q2569192"
From MaRDI portal
The following pages link to Globally convergent interior-point algorithm for nonlinear programming (Q2569192):
Displaying 15 items.
- Numerical experiments with an interior-exterior point method for nonlinear programming (Q702481) (← links)
- An interior-point algorithm for nonlinear minimax problems (Q963659) (← links)
- A globally convergent interior point algorithm for non-convex nonlinear programming (Q1002202) (← links)
- A globally convergent algorithm for nonlinearly constrained optimization problems (Q1071653) (← links)
- Global convergence enhancement of classical linesearch interior point methods for MCPs (Q1861321) (← links)
- A globally convergent primal-dual interior-point filter method for nonlinear programming (Q1881567) (← links)
- Convergence of an interior point algorithm for continuous minimax (Q1956470) (← links)
- Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties (Q2494514) (← links)
- Globally convergent interior-point algorithm for nonlinear programming (Q2569192) (← links)
- Mixed integer nonlinear programming using interior-point methods (Q3096887) (← links)
- A globally convergent version of a general recursive algorithm for nonlinear programming (Q3741433) (← links)
- A resolução do problema de despacho ótimo de reativos pelo método da função lagrangiana-barreira relaxada (Q4905610) (← links)
- A globally convergent regularized interior point method for constrained optimization (Q5058383) (← links)
- An infeasible interior-point technique to generate the nondominated set for multiobjective optimization problems (Q6164611) (← links)
- Duality in convex optimization for the hyperbolic augmented Lagrangian (Q6500232) (← links)
