A PRACTICAL APPROACH TO DECOMPOSABLE NONLINEAR PROGRAMMING PROBLEMS
From MaRDI portal
Publication:4201654
Recommendations
- An Exact Penalty Function and Relaxation Approach for Solving Decomposable Nonlinear Programs
- Nonlinear Programs with Complicating Variables: Theoretical Analysis and Numerical Experience
- Certain questions in solving block nonlinear optimization problems with coupling variables
- An Improved Successive Linear Programming Algorithm
- scientific article; zbMATH DE number 3908186
Cited in
(12)- Simple solution procedures for nonlinear programming problems that are derivative decomposable
- A decomposition procedure based on approximate Newton directions
- A decomposition method for MINLPs with Lipschitz continuous nonlinearities
- Certain questions in solving block nonlinear optimization problems with coupling variables
- A linear programming decomposition focusing on the span of the nondegenerate columns
- A decomposition approach to the solution of some integer programming problems with inexact data
- scientific article; zbMATH DE number 3908186 (Why is no real title available?)
- Nonlinear Programs with Complicating Variables: Theoretical Analysis and Numerical Experience
- Nested decomposition of multistage nonlinear programs with recourse
- Recent advances in the decomposition approach to linear programming
- An Exact Penalty Function and Relaxation Approach for Solving Decomposable Nonlinear Programs
- Linear decomposition approach for a class of nonconvex programming problems
This page was built for publication: A PRACTICAL APPROACH TO DECOMPOSABLE NONLINEAR PROGRAMMING PROBLEMS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4201654)