An Aggregate Constraint Method for Non-Linear Programming
From MaRDI portal
Recommendations
- An aggregate function method for nonlinear programming
- The aggregate constraint homotopy method for nonconvex nonlinear programming
- An aggregate homotopy interior-point method for general nonlinear programming problems
- Solving nonconvex nonlinear programming problems via a new aggregate constraint homotopy method
Cited in
(23)- On Surrogate Duality and Competition between Entropy and Potential Energy in the Finite Element Model of Elastic Contact Mechanics
- Solving a system of infinitely many fuzzy inequalities with piecewise linear membership functions
- The flattened aggregate constraint homotopy method for nonlinear programming problems with many nonlinear constraints
- On zero duality gap in surrogate constraint optimization: the case of rational-valued functions of constraints
- On generalized surrogate duality in mixed-integer nonlinear programming
- Flattened aggregate function method for nonlinear programming with many complicated constraints
- Constraint consensus concentration for identifying disjoint feasible regions in nonlinear programmes
- Solving nonconvex nonlinear programming problems via a new aggregate constraint homotopy method
- An aggregate function method for nonlinear programming
- A comparison of normal cone conditions for homotopy methods for solving inequality constrained nonlinear programming problems
- Solving contact forces with the competition between potential energy and entropy in elastic mechanics
- Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints
- Extension of a hybrid genetic algorithm for nonlinear programming problems with equality and inequality constraints.
- A note on aggregating constraints in integer programming
- The aggregate constraint homotopy method for nonconvex nonlinear programming
- A smoothing method for zero--one constrained extremum problems
- An aggregate deformation homotopy method for min-max-min problems with max-min constraints
- On generalized surrogate duality in mixed-integer nonlinear programming
- Truncated aggregate homotopy method for nonconvex nonlinear programming
- A truncated aggregate smoothing Newton method for minimax problems
- Zero duality gap in surrogate constraint optimization: a concise review of models
- A gradient-based approach for discrete optimum design
- A solution method on condense single constraint by using K-S function for nonlinear programming
This page was built for publication: An Aggregate Constraint Method for Non-Linear Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3984311)
