Convergence Conditions for Nonlinear Programming Algorithms
From MaRDI portal
Publication:5585897
DOI10.1287/MNSC.16.1.1zbMATH Open0191.49101OpenAlexW2023068466MaRDI QIDQ5585897FDOQ5585897
Authors: 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
Cited In (only showing first 100 items - show all)
- Local convergence of the fuzzy c-means algorithms
- Heuristische Lösungsverfahren Versuch einer Begriffsklärung
- Low-dose-rate extrapolation of data from animal carcinogenicity experiments. - Analysis of a new statistical technique
- A conversation with Jeff Wu
- Maximization of linearly constrained posynomials
- Large-scale problem analysis and decomposition theory
- Combinatorial behavior of extreme points of perturbed polyhedra
- A general algorithm for obtaining simple structure of core arrays in \(N\)-way PCA with application to fluorometric data
- Optimal cargo allocation on board a plane: A sequential linear programming approach
- Some remarks on condensation methods for geometric programs
- An exact penalty function algorithm for solving general constrained parameter optimization problems
- The Topkis-Veinott algorithm for solving nonlinear programs with lower and upper bounded variables
- Convergence of relaxation algorithms by averaging
- Some notes on the time-variant Lyapunov theory
- Interval Newton methods and perturbed problems
- An algorithm for linearly constrained programs with a partly linear objective function
- A geometric approach of gradient descent algorithms in linear neural networks
- Global and variable cost manufacturing systems
- An algorithm for Ramsey pricing by multiproduct public firms under incomplete information
- Using weighting vectors to solve multiple attribute problems: A framework
- Lagrangian dual ascent by generalized linear programming
- Numerical computational methods of optimisation in control
- A distribution multi-echelon lot-size model
- Bounding the inefficiency of Nash equilibria in games with finitely many players
- Convex optimization approach to signals with fast varying instantaneous frequency
- Asymptotic theory for analyzing dose-response survival data with application to the low-dose extrapolation problem
- MINIMAX SOLUTIONS IN STOCHASTIC PROGRAMMING
- On the convergence of a class of nonlinear approximation methods
- Bounds for stochastic convex programs
- A decomposition algorithm for solving a class of optimal control problems
- Using efficient feasible directions in interactive multiple objective linear programming
- A variable structure convex programming based control approach for a class of uncertain linear systems
- A method for approximating the solution set of a system of convex inequalities by polytopes
- The multi-dimensional von Neumann alternating direction search algorithm in \(C(B)\) and \(L_1\)
- Vector maximisation and lagrange multipliers
- ROS regression: integrating regularization with optimal scaling regression
- A Tikhonov regularized penalty function approach for solving polylinear programming problems
- Necessary and sufficient conditions for convergence of iteration algorithms of nonlinear programming
- Applications of a general convergence theory for outer approximation algorithms
- A new approach to stochastic programming problems: Discrete model
- On subsidiary problems in geometric programming
- Eigenvector saddlepoints and zero properties of the eigenpolynomial factors
- Algorithm model for penalty functions-type iterative pcedures
- A dual formulation for generating information about constrained optima in automated design
- A generalization of Lagrange's method of undetermined multipliers using zero-zone functionals
- A canonical structure for iterative procedures
- Finite sample moments results for the quasi-FIML estimator of the reduced form: The linear case
- Linear Chebyshev Approximation of Complex-Valued Functions
- Explicit duality for convex homogeneous programs
- A unified approach to the feasible direction methods for nonlinear programming with linear constraints
- Trader-commodity parity theorems
- Nonlinear programming with cumulatively bounded variables
- A unified description of iterative algorithms for traffic equilibria
- Nonparametric estimation and consistency for renewal processes
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
- stochastic quasigradient methods and their application to system optimization†
- Distributed asynchronous computation of fixed points
- Canonical bases in linear programming
- A nontangential cutting plane algorithm
- Penalty function methods and a duality gap for invex optimization problems
- Fractional programming
- Generalized second-order derivatives and optimality conditions
- Biconvex sets and optimization with biconvex functions: a survey and extensions
- Modified descent methods for solving the monotone variational inequality problem
- Sufficient conditions for the convergence of monotonic mathematical programming algorithms
- A constrained optimization approach to solving certain systems of convex equations
- Implied constraints and a unified theory of duality in linear and nonlinear programming
- The application of generalized Benders decomposition to certain nonconcave programs
- Stochastic approximation of constrained systems with system and constraint noise
- Lagrangian duality for preinvex set-valued functions
- A convergence theorem of Rosen’s gradient projection method
- A stochastic approximation counterpart of the feasible direction method
- Discussion on the convergence of Rosen's gradient projection method
- Remarks on the convergence of Rosen's gradient projection method
- Horizontal mixed decomposition
- The linearized version of an algorithm for the mixed norms problem
- An efficient dual approach to the urban road network design problem
- Applications of fuzzy set theory to mathematical programming
- A block coordinate variable metric forward-backward algorithm
- Isosystolic inequalities for optical hypersurfaces
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- Global convergence of Rosen's gradient projection method
- On the convergence of a class of outer approximation algorithms for convex programs
- Global asymptotic stability of non-linear difference equations
- A fast polynomial time algorithm for logistics network flows
- A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
- Optimal consensus of fuzzy opinions under group decision making environment
- A combinatorial approximation algorithm for supply chain network flow problem
- Generalized Kuhn-Tucker conditions and duality for continuous nonlinear programming problems
- Convergence properties of relaxation algorithms
- Optimality conditions and duality in continuous programming. I: Convex programs and a theorem of the alternative
- A procedure for new product positioning in an attribute space
- Nadler's type principle with high order of convergence
- Positive definite constrained least-squares estimation of matrices
- Modelling considerations in optimal design of reinforced structures
- The unilateral frictionless contact of a piezoelectric body with a rigid support.
- A convergence theorem for the fuzzy subspace clustering (FSC) algorithm
- Bi-criteria fuzzy \(c\)-means analysis
- Adjustment process-based approach for computing a Nash-Cournot equilibrium
- An algorithm for constrained convex optimization
This page was built for publication: Convergence Conditions for Nonlinear Programming Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5585897)