scientific article; zbMATH DE number 1488903

MaRDI QIDQ4495741zbMATH OpenFDO

Authors Xibin Chen, Michael M. Kostreva

Publication date 8 July 2001

zbMATH Keywords

direction finding subproblemsfeasible directioninequality constraintsnonlinear optimisation

Mathematics Subject Classification ID

Numerical methods based on nonlinear programming (49M37) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Nonlinear programming (90C30)

Recommendations

• scientific article; zbMATH DE number 1925785
• scientific article; zbMATH DE number 123747
• A feasible directions method on combining feasibility with descent for nonlinear constrained optimization
• A two-stage feasible directions algorithm for nonlinear constrained optimization
• scientific article; zbMATH DE number 3965830

Cited in

(13)

• Enhanced methods for feasible directions for engineering design problems
• Norm-relaxed method of feasible directions for solving nonlinear programming problems
• Design concepts for generating optimised lattice structures aligned with strain trajectories
• A feasible directions method on combining feasibility with descent for nonlinear constrained optimization
• scientific article; zbMATH DE number 3918107 (Why is no real title available?)
• Feasibility and optimality in structural design
• scientific article; zbMATH DE number 1925785 (Why is no real title available?)
• Methods for finding feasible points in constrained optimization
• A superlinearly convergent method of feasible directions.
• Local feasible QP-free algorithms for the constrained minimization of SC^1 functions
• An accelerated method for solving constrained multi-objective optimization
• Feature-based network construction: from sampling to what-if analysis
• Finitely convergent \(\varepsilon\)-generalized projection algorithm for nonlinear systems

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 Q4495741)