A penalty-free method for equality constrained optimization
From MaRDI portal
Recommendations
- A penalty-free method with superlinear convergence for equality constrained optimization
- Nonlinear programming without a penalty function or a filter
- A penalty-free method with line search for nonlinear equality constrained optimization
- A new penalty-free-type algorithm based on trust region techniques
- A globally convergent penalty-free method for optimization with equality constraints and simple bounds
Cited in
(15)- On the global convergence of a projective trust region algorithm for nonlinear equality constrained optimization
- Equality saturation
- Nonlinear programming without a penalty function or a filter
- A Matrix-Free Algorithm for Equality Constrained Optimization Problems with Rank-Deficient Jacobians
- A penalty-free method with line search for nonlinear equality constrained optimization
- A line search exact penalty method with bi-object strategy for nonlinear constrained optimization
- A hybrid method combining genetic algorithm and Hooke-Jeeves method for constrained global optimization
- Solving constrained global optimization problems without penalty parameters
- scientific article; zbMATH DE number 5584607 (Why is no real title available?)
- A penalty-free method with superlinear convergence for equality constrained optimization
- A sequential adaptive regularisation using cubics algorithm for solving nonlinear equality constrained optimization
- An extension of the Fletcher-Reeves method to linear equality constrained optimization problem
- A new penalty-free-type algorithm based on trust region techniques
- Approximate greatest descent methods for optimization with equality constraints
- A globally convergent penalty-free method for optimization with equality constraints and simple bounds
This page was built for publication: A penalty-free method for equality constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q380463)
