Steepest ascent algorithms for nonconical multiple objective programming

DOI10.1016/0022-247X(84)90075-1MaRDI QIDQ795749zbMATH OpenFDO

Authors Gordon B. Hazen, Thomas Morin

Publication date 1984

Published in Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0022-247X(84)90075-1

zbMATH Keywords

continuous variable unconstrained nonconical multiple objective programmingsteepest ascent algorithmsvector optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Sensitivity, stability, parametric optimization (90C31)

Recommendations

• On the convergence of steepest descent methods for multiobjective optimization
• Steepest descent methods for multicriteria optimization.
• An Algorithm for Multiple-objective Non-linear Programming
• scientific article; zbMATH DE number 3970548
• Nonlinear multiple objective optimization: An algorithm and some theory
• scientific article; zbMATH DE number 1092213
• Steepest-descent approach to triple hierarchical constrained optimization problems
• Nonlinear and unconstrained multiple-objective optimization: Algorithm, computation, and application
• scientific article; zbMATH DE number 1131476

Cites work

• Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
• Convergence Conditions for Nonlinear Programming Algorithms
• scientific article; zbMATH DE number 3677592 (Why is no real title available?)
• scientific article; zbMATH DE number 3281211 (Why is no real title available?)
• scientific article; zbMATH DE number 3307201 (Why is no real title available?)
• scientific article; zbMATH DE number 3320765 (Why is no real title available?)
• scientific article; zbMATH DE number 3186512 (Why is no real title available?)
• Interactive Identification and Optimization Using a Binary Preference Relation
• Optimality conditions in nonconical multiple objective programming
• Preference Convex Unanimity in Multiple Criteria Decision Making
• Stability of nondominated solutions in multicriteria decision-making

Cited in

(4)

• Pruning of decision alternatives in multiple criteria decision making, based on the UTA method for estimating utilities
• Steepest descent methods for multicriteria optimization.
• Solving a linear multiperiod portfolio problem by interior-point methodology
• On the convergence of steepest descent methods for multiobjective optimization

This page was built for publication: Steepest ascent algorithms for nonconical multiple objective programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q795749)