scientific article; zbMATH DE number 764397
From MaRDI portal
Publication:4836283
Recommendations
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
- A truncated Newton method for the solution of large-scale inequality constrained minimization problems
- A new constraints identification technique-based QP-free algorithm for the solution of inequality constrained minimization problems.
- A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
- A sequential equality constrained quadratic programming algorithm for inequality constrained optimization
Cited in
(13)- A truncated Newton method for the solution of large-scale inequality constrained minimization problems
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
- A new concave minimization algorithm for the absolute value equation solution
- A greedy Newton-type method for multiple sparse constraint problem
- Newton Methods For Large-Scale Linear Inequality-Constrained Minimization
- A Gauss-Newton Approach to Solving Generalized Inequalities
- An Algorithm for the Inequality-Constrained Discrete Min--Max Problem
- Newton-type Alternating Minimization Algorithm for Convex Optimization
- Study of a primal-dual algorithm for equality constrained minimization
- An adaptive penalty method for inequality constrained minimization problems
- An active set Newton's interior-point algorithm for solving a constrained optimization problem
- Newton method of solving Karush-Kuhn-Tucker systems for a constrained Minimax Problem
- The Newton bracketing method for the minimization of convex functions subject to affine constraints
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4836283)
