Optimization algorithms for a class of nonlinear programming problems

DOI10.1016/0898-1221(88)90169-1zbMATH Open0648.90068OpenAlexW2084524929MaRDI QIDQ1105491FDOQ1105491

Authors: S. H. Smith 

Publication date: 1988

Published in: Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(88)90169-1

Recommendations

• Complexity and algorithms for nonlinear optimization problems
• An algorithm for separable nonlinear minimax problems
• Complexity and algorithms for convex network optimization and other nonlinear problems
• The complexity of a special convex programming problem connected with nonlinear optimization
• An algorithm for nonlinear programs over Cartesian product sets

zbMATH Keywords

Newton's methodsteepest descent methodtime complexitylinear constraintsvoltage dropsnonlinear separable functionmultidimensional Euclidean spacepower nets in integrated circuits

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Nonlinear programming (90C30)

Cites Work

• An approach to nonlinear programming
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (8)

• A heuristic algorithm for nonlinear programming
• Title not available (Why is that?)
• Class of optimization algorithms for the solution of large nonlinear programming problems. II
• A Fourth bibliography of fractional programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithms of nondifferentiable optimization: development and application
• Title not available (Why is that?)

This page was built for publication: Optimization algorithms for a class of nonlinear programming problems

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