Minimization methods with constraints

DOI10.1007/BF01091662zbMath0348.90106MaRDI QIDQ1234628

Boris T. Polyak

Publication date: 1976

Published in: Journal of Soviet Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Numerical methods in optimal control (49M99)

Related Items

Mathematical theory of optimal control

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Méthodes pour la recherche de points de selle
• Newton's method for convex programming and Tschebyscheff approximation
• A convergent gradient procedure in prehilbert spaces
• La méthode des centres dans un espace topologique
• The restoration of constraints in holonomic and nonholonomic problems
• Sequential gradient-restoration algorithm for the minimization of constrained functions. Ordinary and conjugate gradient versions
• Multiplier and gradient methods
• On iterative methods for solving nonlinear least squares problems over convex sets
• Convergente rate of a penalty-function scheme
• On penalty function methods for nonlinear programming problems
• An algorithmic approach to nonlinear analysis and optimization
• Constrained optimization problems using multiplier methods
• Méthodes numériques pour la décomposition et la minimisation de fonctions non différentiables
• Ein Verfahren zum Minimieren einer Funktion bei eingeschränktem Variationsbereich der Parameter
• Extension of Newton's method to nonlinear functions with values in a cone
• On the method of multipliers for mathematical programming problems
• An approach to nonlinear programming
• Optimierung unter Nebenbedingungen. Struktur einer Klasse von Algorithmen. I
• Global convergence for Newton methods in mathematical programming
• A new approach to constrained function optimization
• The multiplier method of Hestenes and Powell applied to convex programming
• A method of feasible directions using function approximations, with applications to min max problems
• A general approach to one-step iterative methods with application to eigenvalue problems
• A variance algorithm for constrained minimization with linear constraints
• A Non-Linear Extension of the Simplex Method
• A Nonlinear Programming Technique for the Optimization of Continuous Processing Systems
• Convex Programming by Tangential Approximation
• Non-Linear Programming—A Survey
• Ein allgemeines Maximalisierungverfahren
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• An Approximate Method for Convex Programming
• The Decomposition Algorithm for Linear Programs
• Accelerating the Cutting Plane Method for Nonlinear Programming
• The Created Response Surface Technique for Optimizing Nonlinear, Restrained Systems
• A Review of Minimization Techniques for Nonlinear Functions
• Projection methods for non-linear programming
• Extremization of functions with equality constraints
• Steepest Ascent for Large Scale Linear Programs
• Rate of Convergence of a Class of Methods of Feasible Directions
• A Generalized Approach to Dantzig-Wolfe Decomposition for Concave Programs
• An Historical Survey of Computational Methods in Optimal Control
• A New Method of Constrained Optimization and a Comparison With Other Methods
• Convex programming in Hilbert space
• Nonlinear Programming: A Numerical Survey
• A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained Problems
• The Supporting Hyperplane Method for Unimodal Programming
• A Ricocheting Gradient Method for Nonlinear Optimization
• Iterative Saddle Point Techniques
• On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
• Optimization by Least Squares
• Application of mathematical programming in the design of optimal control systems†
• Über einige Näherungsverfahren zur Lösung nichtlinearer Variationsungleichungen und konvexer Minimumprobleme mit Nebenbedingungen
• An Exact Potential Method for Constrained Maxima
• A New Method for Constrained Optimization Problems
• Constrained Nonlinear Optimization by Heuristic Programming
• Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
• A Tight Upper Bound on the Rate of Convergence of Frank-Wolfe Algorithm
• An algorithm for solving nonlinear programming problems subject to nonlinear inequality constraints
• A new method for the optimization of a nonlinear function subject to nonlinear constraints
• An Accelerated Gradient Projection Method for Linearly Constrained Nonlinear Estimation
• An Iterative Procedure for Computing the Minimum of a Quadratic Form on a Convex Set
• Comparison of Gradient Methods for the Solution of Nonlinear Parameter Estimation Problems
• Dynamic Programming, System Identification, and Suboptimization
• Cutting-Plane Methods without Nested Constraint Sets
• Abstract Models for the Synthesis of Optimization Algorithms
• The Conjugate Residual Method for Constrained Minimization Problems
• Elements of Large-Scale Mathematical Programming Part I: Concepts
• Iterative Solution of Nonlinear Optimal Control Problems
• The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
• The Gradient Projection Method under Mild Differentiability Conditions
• A Computer Comparison of Four Quadratic Programming Algorithms
• Penalty function versus non-penalty function methods for constrained nonlinear programming problems
• Convergence rate of the gradient descent method with dilatation of the space
• Iterationsverfahren für einige nichtlineare Probleme mit Nebenbedingungen
• An efficient algorithm for minimizing barrier and penalty functions
• On the theory of maximin problems
• The Gradient Projection Method Along Geodesics
• A Drivable Method of Feasible Directions
• An iterative method, having linear rate of convergence, for solving a pair of dual linear programs
• A Kuhn–Tucker Algorithm
• Constrained Optimization Using a Nondifferentiable Penalty Function
• A computational comparison of some non-linear programs
• A Convergence Theory for a Class of Nonlinear Programming Problems
• The Generalized Penalty-Function/Surrogate Model
• Technical Note—Theorems of Convergence for Improved Nonlinear Programming Algorithms
• On the Convergence of Gradient Methods under Constraint
• A quadratically-convergent algorithm for general nonlinear programming problems
• On a Method of Courant for Minimizing Functionals
• AN ALGORITHM FOR CONVEX PROGRAMMING
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities
• Variational methods for the solution of problems of equilibrium and vibrations
• On the convergence of sequential minimization algorithms