An aggregate homotopy interior-point method for general nonlinear programming problems
From MaRDI portal
Recommendations
- An aggregate homotopy interior-point method for a class of nonsmooth constrained optimization problems
- The aggregate constraint homotopy method for nonconvex nonlinear programming
- Aggregate homotopy interior-point method for constrained sequential max-min problems
- Solving nonconvex nonlinear programming problems via a new aggregate constraint homotopy method
- Strong convergence on the aggregate constraint-shifting homotopy method for solving general nonconvex programming
Cited in
(12)- The flattened aggregate constraint homotopy method for nonlinear programming problems with many nonlinear constraints
- An aggregate homotopy interior-point method for a class of nonsmooth constrained optimization problems
- Flattened aggregate function method for nonlinear programming with many complicated constraints
- Strong convergence on the aggregate constraint-shifting homotopy method for solving general nonconvex programming
- Solving nonconvex nonlinear programming problems via a new aggregate constraint homotopy method
- An aggregate function method for nonlinear programming
- Aggregate homotopy interior-point method for constrained sequential max-min problems
- Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints
- scientific article; zbMATH DE number 1983558 (Why is no real title available?)
- The aggregate constraint homotopy method for nonconvex nonlinear programming
- scientific article; zbMATH DE number 5812524 (Why is no real title available?)
- scientific article; zbMATH DE number 5307347 (Why is no real title available?)
This page was built for publication: An aggregate homotopy interior-point method for general nonlinear programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2917886)
