On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming

DOI10.1137/0305018zbMath0158.18805OpenAlexW2077830999MaRDI QIDQ5541039

Donald M. Topkis, Arthur F. jun. Veinott

Publication date: 1967

Published in: SIAM Journal on Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0305018

zbMATH Keywords

operations research

Related Items

A discussion of probability functions and constraints from a variational perspective, Restricted simplicial decomposition for convex constrained problems, Norm-relaxed method of feasible directions for solving nonlinear programming problems, New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate, Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints, Feasible direction method for bilevel programming problem, A new trust region–sequential quadratic programming approach for nonlinear systems based on nonlinear model predictive control, Convergence analysis of norm-relaxed method of feasible directions, A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization, Bilevel Optimization: Reformulation and First Optimality Conditions, A strongly convergent norm-relaxed method of strongly sub-feasible direction for optimization with nonlinear equality and inequality constraints, Self-tuning norm-relaxed method of feasible directions, A two-stage feasible directions algorithm for nonlinear constrained optimization, A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization, On the rate of convergence of certain methods of centers, An algorithm for linearly constrained nonlinear programming problems, Lokale konvergenzeigenschaften einer klasse von iterationsverfahren der nichtlinearen optimierung, Classes of orderings of measures and related correlation inequalities. II. Multivariate reverse rule distributions, Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions, A new SQP method of feasible directions for nonlinear programming., Stacking sequence and shape optimization of laminated composite plates via a level-set method, A new \(\varepsilon \)-generalized projection method of strongly sub-feasible directions for inequality constrained optimization, Numerical study of some feasible direction methods in mathematical programming, Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems, Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems, A sequential quadratically constrained quadratic programming method of feasible directions, A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization, A method to accelerate the rate of convergence of a class of optimization algorithms, A superlinearly convergent method of feasible directions., An efficient sequential quadratic programming algorithm for nonlinear programming, Rates of convergence for a method of centers algorithm, On the rate of convergence of some feasible direction algorithms, A systematic approach to the synthesis of algorithms, A feasible interior-point algorithm for nonconvex nonlinear programming, A convergence theory for a class of anti-jamming strategies, Sufficient conditions for the convergence of monotonic mathematical programming algorithms, Minimization methods with constraints, Optimal pricing and ordering in global supply chain management with constraints under random demand, On the de-facto convex structure of a least square problem for estimating the term structure of interest rates, A constrained optimization reformulation and a feasible descent direction method for \(L_{1/2}\) regularization, The Topkis-Veinott algorithm for solving nonlinear programs with lower and upper bounded variables, Combined phase I—phase II methods of feasible directions, On differentiability properties of player convex generalized Nash equilibrium problems, An active set sequential quadratic programming algorithm for nonlinear optimisation, Global convergence analysis of algorithms for finding feasible points in norm-relaxed MFD, A method of feasible directions using function approximations, with applications to min max problems, A generalization of the norm-relaxed method of feasible directions, A feasible conjugate direction method to solve linearly constrained minimization problems, Nonwastefulness of interior iterative procedures, A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization, Quadratically constrained quadratic programming: Some applications and a method for solution, Enhanced methods for feasible directions for engineering design problems, Applications of a general convergence theory for outer approximation algorithms