Steepest descent method for solving zero-one nonlinear programming problems

DOI10.1016/J.AMC.2007.03.088MaRDI QIDQ990588zbMATH OpenOpenAlexFDO

Authors M. Anjidani, Sohrab Effati

Publication date 1 September 2010

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2007.03.088

zbMATH Keywords

penalty functionsteepest descent methodunconstrained optimizationzero-one nonlinear programming problem

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Recommendations

• A hybrid PSO algorithm based on penalty function for solving zero-one nonlinear programming problems
• Unconstrained 0-1 nonlinear programming: A nondifferentiable approach
• Steepest descent method for solving fuzzy nonlinear equations
• A Boolean penalty method for zero-one nonlinear programming
• The steepest descent direction for the nonlinear bilevel programming problem

Cites work

• A duality theorem and an algorithm for (mixed-) integer nonlinear programming
• scientific article; zbMATH DE number 3748742 (Why is no real title available?)
• Integer Programming: Methods, Uses, Computations

Cited in

(6)

• Calculating the mean amplitude of glycemic excursions from continuous glucose data using an open-code programmable algorithm based on the integer nonlinear method
• A hybrid PSO algorithm based on penalty function for solving zero-one nonlinear programming problems
• scientific article; zbMATH DE number 5369699 (Why is no real title available?)
• scientific article; zbMATH DE number 6792615 (Why is no real title available?)
• Relaxed steepest descent and Cauchy-Barzilai-Borwein method
• A method of inexact steepest descent for systems of linear equations

This page was built for publication: Steepest descent method for solving zero-one nonlinear programming problems

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