Solving nonlinear programming problems with very many constraints
From MaRDI portal
sequential quadratic programmingoptimal controlmin-max optimizationmechanical structural optimizationsmooth constrained nonlinear programming
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Semi-infinite programming (90C34) Optimization problems in solid mechanics (74P99)
Recommendations
- Nonlinear integer programming for various forms of constraints
- scientific article; zbMATH DE number 1779725
- scientific article; zbMATH DE number 5070336
- Solving mathematical programs with complementarity constraints as nonlinear programs
- scientific article; zbMATH DE number 124136
- A novel approach for solving multi-parametric problems with nonlinear constraints
- scientific article; zbMATH DE number 4123537
- Solving nonlinear programming problems involving discrete, integer, and continuous variables
- Solving linear programming with constraints unknown
Cites work
- scientific article; zbMATH DE number 3869080 (Why is no real title available?)
- scientific article; zbMATH DE number 3793774 (Why is no real title available?)
- A comparative study of several semi-infinite nonlinear programming algorithms
- A globally convergent method for nonlinear programming
- A numerically stable dual method for solving strictly convex quadratic programs
- Algorithms for nonlinear constraints that use lagrangian functions
- Combined lp and quasi-Newton methods for minimax optimization
- On the convergence of a sequential quadratic programming method with an augmented lagrangian line search function
- On the quadratic programming algorithm of Goldfarb and Idnani
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
Cited in
(8)- Programming Problems with a Large Number of Objective Functions
- An active set strategy for solving optimization problems with up to 200,000,000 nonlinear constraints
- Programming with a non-differentiable constraint.
- A new constraint test-case generator and the importance of hybrid optimizers
- Solving non-linear constraint satisfaction problems involving time-dependent functions
- scientific article; zbMATH DE number 1860712 (Why is no real title available?)
- A multipurpose parallel genetic hybrid algorithm for nonlinear nonconvex programming problems
- Improvements on objective and constrain functions in domain optimization
This page was built for publication: Solving nonlinear programming problems with very many constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4327941)
