A hybrid method fur linearly constrained optimisation problems

DOI10.1080/02331938608843136MaRDI QIDQ3735487zbMATH OpenOpenAlexFDO

Authors K. Schönefeld

Publication date 1986

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331938608843136

zbMATH Keywords

convergence analysispenalty methodhybrid methodnonlinear objective functionorder of convergencelinear constraintsWilson methodcomputation of Kuhn-Tucker- pointsRobinson's-method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Numerical methods based on necessary conditions (49M05) Mathematical programming (90C99)

Recommendations

• A hybrid method for linear programming
• A hybrid approach to constrained optimization problems
• A hybrid method for solving general constrained optimization problems
• A hybrid algorithm for linearly constrained minimax problems
• scientific article; zbMATH DE number 870928
• A Hybrid Approach to Multi-objective Linear Optimization
• scientific article; zbMATH DE number 169371
• scientific article; zbMATH DE number 4012317
• scientific article; zbMATH DE number 4009673
• scientific article; zbMATH DE number 3978840

Cites work

• scientific article; zbMATH DE number 3159112 (Why is no real title available?)
• scientific article; zbMATH DE number 3709953 (Why is no real title available?)
• scientific article; zbMATH DE number 3545359 (Why is no real title available?)
• scientific article; zbMATH DE number 3624709 (Why is no real title available?)
• A Method of Conjugate Directions for Linearly Constrained Nonlinear Programming Problems
• A feasible conjugate direction method to solve linearly constrained minimization problems
• A globally and quadratically convergent algorithm for general nonlinear programming problems
• Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
• On the global and superlinear convergence of a discretized version of Wilson's method

Cited in

(8)

• A solution framework for linear PDE-constrained mixed-integer problems
• On the globalization of Wilson-type optimization methods by means of generalized reduced gradient methods
• A hybrid algorithm for infinitely constrained optimization
• Hybrid procedures for solving some unconstrained nonlinear optimization problems
• scientific article; zbMATH DE number 653035 (Why is no real title available?)
• 基于混合搜索的含逻辑“与”“或”的RM优化算法
• On a class fo hybrid methods for smooth constrained optimization
• Linearization of McCormick relaxations and hybridization with the auxiliary variable method

This page was built for publication: A hybrid method fur linearly constrained optimisation problems

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