Pages that link to "Item:Q781112"
From MaRDI portal
The following pages link to A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs (Q781112):
Displaying 14 items.
- Handling infeasibility in a large-scale nonlinear optimization algorithm (Q430999) (← links)
- Feasibility issues in a primal-dual interior-point method for linear programming (Q803044) (← links)
- Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems (Q1572675) (← links)
- A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs (Q2105288) (← links)
- An interior point method for nonlinear programming with infeasibility detection capabilities (Q2926056) (← links)
- (Q4919139) (← links)
- Rapid infeasibility detection in a mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization (Q5198049) (← links)
- A globally convergent primal-dual interior-point relaxation method for nonlinear programs (Q5216730) (← links)
- A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints (Q5879119) (← links)
- IPRQP: a primal-dual interior-point relaxation algorithm for convex quadratic programming (Q6064060) (← links)
- Multiobjective optimization with least constraint violation: optimality conditions and exact penalization (Q6085748) (← links)
- The augmented Lagrangian method can approximately solve convex optimization with least constraint violation (Q6102759) (← links)
- An overview of nonlinear optimization (Q6200213) (← links)
- IPRSDP: a primal-dual interior-point relaxation algorithm for semidefinite programming (Q6498407) (← links)
