Convergence Conditions for Nonlinear Programming Algorithms

DOI10.1287/mnsc.16.1.1zbMath0191.49101OpenAlexW2023068466MaRDI QIDQ5585897

Willard I. Zangwill

Publication date: 1969

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.16.1.1

zbMATH Keywords

operations research

Related Items

Extensions of Radstrom's lemma with application to stability theory of mathematical programming, A computable convex programming characterization of optimal interpolatory quadratic splines with free knots, A model for elastic-viscoplastic deformations of crystalline solids based on material symmetry: theory and plane-strain simulations, Local convergence of the fuzzy c-means algorithms, Isosystolic inequalities for optical hypersurfaces, Nadler's type principle with high order of convergence, Combinatorial behavior of extreme points of perturbed polyhedra, A constrained optimization approach to solving certain systems of convex equations, Approximate conversion of spline curves, Positive definite constrained least-squares estimation of matrices, Convergence of relaxation algorithms by averaging, A stochastic approximation counterpart of the feasible direction method, A shadow price in integer programming for management decision, Eigenvector saddlepoints and zero properties of the eigenpolynomial factors, Minimax estimation for singular linear multivariate models with mixed uncertainty, On the convergence of reference point methods in multiobjective programming, Interval Newton methods and perturbed problems, Bi-criteria fuzzy \(c\)-means analysis, An algorithm for Ramsey pricing by multiproduct public firms under incomplete information, Using weighting vectors to solve multiple attribute problems: A framework, Finite sample moments results for the quasi-FIML estimator of the reduced form: The linear case, Lagrangian dual ascent by generalized linear programming, A Tikhonov regularized penalty function approach for solving polylinear programming problems, Lagrangian duality for preinvex set-valued functions, Convex optimization approach to signals with fast varying instantaneous frequency, Nonparametric estimation and consistency for renewal processes, Alternating projections on nontangential manifolds, A combinatorial approximation algorithm for supply chain network flow problem, A new approach to stochastic programming problems: Discrete model, Asymptotic theory for analyzing dose-response survival data with application to the low-dose extrapolation problem, Generalized Kuhn-Tucker conditions and duality for continuous nonlinear programming problems, Nonlinear programming with cumulatively bounded variables, Optimality conditions and duality in continuous programming. I: Convex programs and a theorem of the alternative, Global asymptotic stability of non-linear difference equations, Optimal cargo allocation on board a plane: A sequential linear programming approach, Canonical bases in linear programming, The linearized version of an algorithm for the mixed norms problem, Convergence behavior of an iterative reweighting algorithm to compute multivariate M-estimates for location and scatter, On the convergence of nonstationary algorithms modeled by point-to-set maps, A network model of migration equilibrium with movement costs, Penalty function methods and a duality gap for invex optimization problems, On the convergence of a class of nonlinear approximation methods, A fast polynomial time algorithm for logistics network flows, Using efficient feasible directions in interactive multiple objective linear programming, A survey on the continuous nonlinear resource allocation problem, A method for approximating the solution set of a system of convex inequalities by polytopes, On the convergence of the block nonlinear Gauss-Seidel method under convex constraints, Approximation in multiobjective optimization, The multi-dimensional von Neumann alternating direction search algorithm in \(C(B)\) and \(L_1\), Biconvex sets and optimization with biconvex functions: a survey and extensions, Bounding the inefficiency of Nash equilibria in games with finitely many players, A distribution multi-echelon lot-size model, An algorithm for linearly constrained programs with a partly linear objective function, A convergence theorem for the fuzzy subspace clustering (FSC) algorithm, On subsidiary problems in geometric programming, The restricted EM algorithm under inequality restrictions on the parameters, Algorithm model for penalty functions-type iterative pcedures, Inelastic analysis of suspension structures by nonlinear programming, A dual formulation for generating information about constrained optima in automated design, A heuristic algorithm for network equilibration, Stochastic approximation of constrained systems with system and constraint noise, Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints, A generalization of Lagrange's method of undetermined multipliers using zero-zone functionals, Nonnegative matrix factorization and I-divergence alternating minimization, A canonical structure for iterative procedures, Trader-commodity parity theorems, Sufficient conditions for the convergence of monotonic mathematical programming algorithms, Low-dose-rate extrapolation of data from animal carcinogenicity experiments. - Analysis of a new statistical technique, Remarks on the convergence of Rosen's gradient projection method, Discussion on the convergence of Rosen's gradient projection method, Horizontal mixed decomposition, A procedure for new product positioning in an attribute space, A block coordinate variable metric forward-backward algorithm, A review of techniques for automated structural design, A conversation with Jeff Wu, Maximization of linearly constrained posynomials, An algorithm for finding the shortest element of a polyhedral set with application to Lagrangian duality, Large-scale problem analysis and decomposition theory, An efficient dual approach to the urban road network design problem, ROS regression: integrating regularization with optimal scaling regression, A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality, The Topkis-Veinott algorithm for solving nonlinear programs with lower and upper bounded variables, An exact penalty function algorithm for solving general constrained parameter optimization problems, Some notes on the time-variant Lyapunov theory, Modelling considerations in optimal design of reinforced structures, Global and variable cost manufacturing systems, Global convergence of Rosen's gradient projection method, On the convergence of a class of outer approximation algorithms for convex programs, A decision process over variables and their number: Two-phase optimality conditions, Steepest ascent algorithms for nonconical multiple objective programming, A unified approach to the feasible direction methods for nonlinear programming with linear constraints, The unilateral frictionless contact of a piezoelectric body with a rigid support., Applications of fuzzy set theory to mathematical programming, Modified descent methods for solving the monotone variational inequality problem, Adjustment process-based approach for computing a Nash-Cournot equilibrium, Implied constraints and a unified theory of duality in linear and nonlinear programming, A general algorithm for obtaining simple structure of core arrays in \(N\)-way PCA with application to fluorometric data, Optimal consensus of fuzzy opinions under group decision making environment, A unified description of iterative algorithms for traffic equilibria, A nontangential cutting plane algorithm, Vector maximisation and lagrange multipliers, Linear Chebyshev Approximation of Complex-Valued Functions, The application of generalized Benders decomposition to certain nonconcave programs, Continuousization of the family of point-to-set maps and its applications, Fixed Points and Stationary Points of Dissipative Multivalued Maps, Generalized second-order derivatives and optimality conditions, A geometric approach of gradient descent algorithms in linear neural networks, Rank reduction of correlation matrices by majorization, Heuristische Lösungsverfahren Versuch einer Begriffsklärung, Fractional programming, Necessary and sufficient conditions for convergence of iteration algorithms of nonlinear programming, Explicit duality for convex homogeneous programs, A convergence theorem of Rosen’s gradient projection method, An algorithm for constrained convex optimization, Convergence properties of relaxation algorithms, A variable structure convex programming based control approach for a class of uncertain linear systems, Nonsmooth semi-infinite programming problems with mixed constraints, MINIMAX SOLUTIONS IN STOCHASTIC PROGRAMMING, Numerical computational methods of optimisation in control, Some remarks on condensation methods for geometric programs, A decomposition algorithm for solving a class of optimal control problems, stochastic quasigradient methods and their application to system optimization^†, Distributed asynchronous computation of fixed points, Bounds for stochastic convex programs, Applications of a general convergence theory for outer approximation algorithms