Equivalence in nonlinear programming

DOI10.1002/NAV.3800100127MaRDI QIDQ5334745zbMATH OpenOpenAlexFDO

Authors O. L. Mangasarian

Publication date 1963

Published in Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.3800100127

zbMATH Keywords

operations research

Cites work

• The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints

Cited in

(27)

• Decomposition of the parametric space in multiobjective convex programs using the generalized Tchebycheff norm
• A class of multiple-criteria fractional programming problems
• On fuzzy convexity and parametric fuzzy optimization
• Decomposition of the fuzzy parametric space in multiobjective nonlinear programming problems
• Uncertain liquidity and interbank contracting
• Preference, rationalizability and equilibrium
• A global convergence theory for an active-trust-region algorithm for solving the general nonlinear programing problem.
• Computational comparisons of dual conjugate gradient algorithms for strictly convex networks.
• Maximal descriptor set characterizations of efficient faces in multiple objective linear programming.
• Fiscal federalism revisited
• Spectral theory of copositive matrices
• Concepts of proper efficiency
• A new algorithm for concave quadratic programming
• Endogenous collateral
• Two-person nonzero-sum games and quadratic programming
• A multiplier active-set trust-region algorithm for solving constrained optimization problem
• Lot streaming for quality control in two-stage batch production
• An interior-point penalty active-set trust-region algorithm
• Regression of survival data via twin support vector regression
• A discrete-time neurodynamic approach to sparsity-constrained nonnegative matrix factorization
• scientific article; zbMATH DE number 3272790 (Why is no real title available?)
• Nota sobre programacion lineal estocastica: Evolucion y estado actual. (I)
• A projective method for structured nonlinear programs
• Multiobjective programming under generalized type I invexity
• Some aspects of perfect elimination orderings in chordal graphs
• Farkas' theorem under convex combination
• Individually rational, budget-balanced mechanisms and allocation of surplus

This page was built for publication: Equivalence in nonlinear programming

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