The Flattened Aggregate Constraint Homotopy Method for Nonlinear Programming Problems with Many Nonlinear Constraints
The aggregate constraint homotopy method uses a single smoothing constraint instead of m-constraints to reduce the dimension of its homotopy map, and hence it is expected to be more efficient than the combined homotopy interior point method when the number of constraints is very large. However, the...
Saved in:
Main Authors: | Zhengyong Zhou, Bo Yu |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2014-01-01
|
Series: | Abstract and Applied Analysis |
Online Access: | http://dx.doi.org/10.1155/2014/430932 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Strong Convergence on the Aggregate Constraint-Shifting Homotopy Method for Solving General Nonconvex Programming
by: Zhichuan Zhu, et al.
Published: (2020-01-01) -
Objective penalty function method for nonlinear programming with inequality constraints
by: Zhuolin Yan, et al.
Published: (2024-11-01) -
Nonlinearities Distribution Homotopy Perturbation Method Applied to Solve Nonlinear Problems: Thomas-Fermi Equation as a Case Study
by: U. Filobello-Nino, et al.
Published: (2015-01-01) -
Homotopy Perturbation Method to Obtain Positive Solutions of Nonlinear Boundary Value Problems of Fractional Order
by: Hossein Jafari, et al.
Published: (2014-01-01) -
Fluid-Induced Nonlinear Vibration of a Cantilevered Microtube with Symmetric Motion Constraints
by: Yong Guo
Published: (2020-01-01)