Minimization methods with constraints
From MaRDI portal
Cites work
- A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained Problems
- A computational comparison of some non-linear programs
- A Computer Comparison of Four Quadratic Programming Algorithms
- A Convergence Theory for a Class of Nonlinear Programming Problems
- A convergent gradient procedure in prehilbert spaces
- A Drivable Method of Feasible Directions
- A general approach to one-step iterative methods with application to eigenvalue problems
- A Generalized Approach to Dantzig-Wolfe Decomposition for Concave Programs
- A Kuhn–Tucker Algorithm
- A method of feasible directions using function approximations, with applications to min max problems
- A new approach to constrained function optimization
- A New Method for Constrained Optimization Problems
- A new method for the optimization of a nonlinear function subject to nonlinear constraints
- A New Method of Constrained Optimization and a Comparison With Other Methods
- A nonlinear extension of the simplex method
- A nonlinear programming technique for the optimization of continuous processing systems
- A quadratically-convergent algorithm for general nonlinear programming problems
- A Review of Minimization Techniques for Nonlinear Functions
- A Ricocheting Gradient Method for Nonlinear Optimization
- A Tight Upper Bound on the Rate of Convergence of Frank-Wolfe Algorithm
- A variance algorithm for constrained minimization with linear constraints
- Abstract Models for the Synthesis of Optimization Algorithms
- Accelerating the Cutting Plane Method for Nonlinear Programming
- An Accelerated Gradient Projection Method for Linearly Constrained Nonlinear Estimation
- AN ALGORITHM FOR CONVEX PROGRAMMING
- An algorithm for solving nonlinear programming problems subject to nonlinear inequality constraints
- An algorithmic approach to nonlinear analysis and optimization
- An approach to nonlinear programming
- An Approximate Method for Convex Programming
- An efficient algorithm for minimizing barrier and penalty functions
- An Exact Potential Method for Constrained Maxima
- An Historical Survey of Computational Methods in Optimal Control
- An iterative method, having linear rate of convergence, for solving a pair of dual linear programs
- An Iterative Procedure for Computing the Minimum of a Quadratic Form on a Convex Set
- Application of mathematical programming in the design of optimal control systems†
- Comparison of Gradient Methods for the Solution of Nonlinear Parameter Estimation Problems
- Constrained Nonlinear Optimization by Heuristic Programming
- Constrained optimization problems using multiplier methods
- Constrained Optimization Using a Nondifferentiable Penalty Function
- Convergence rate of the gradient descent method with dilatation of the space
- Convergente rate of a penalty-function scheme
- Convex programming by tangential approximation
- Convex programming in Hilbert space
- Cutting-Plane Methods without Nested Constraint Sets
- Dynamic Programming, System Identification, and Suboptimization
- Ein allgemeines Maximalisierungverfahren
- Ein Verfahren zum Minimieren einer Funktion bei eingeschränktem Variationsbereich der Parameter
- Elements of Large-Scale Mathematical Programming Part I: Concepts
- Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
- Extension of Newton's method to nonlinear functions with values in a cone
- Extremization of functions with equality constraints
- Global convergence for Newton methods in mathematical programming
- scientific article; zbMATH DE number 3115465 (Why is no real title available?)
- scientific article; zbMATH DE number 3122673 (Why is no real title available?)
- scientific article; zbMATH DE number 3148887 (Why is no real title available?)
- scientific article; zbMATH DE number 3174053 (Why is no real title available?)
- scientific article; zbMATH DE number 3493798 (Why is no real title available?)
- scientific article; zbMATH DE number 3498753 (Why is no real title available?)
- scientific article; zbMATH DE number 3518193 (Why is no real title available?)
- scientific article; zbMATH DE number 3552183 (Why is no real title available?)
- scientific article; zbMATH DE number 3428527 (Why is no real title available?)
- scientific article; zbMATH DE number 3206518 (Why is no real title available?)
- scientific article; zbMATH DE number 3220839 (Why is no real title available?)
- scientific article; zbMATH DE number 3224200 (Why is no real title available?)
- scientific article; zbMATH DE number 3225772 (Why is no real title available?)
- scientific article; zbMATH DE number 3247810 (Why is no real title available?)
- scientific article; zbMATH DE number 3249571 (Why is no real title available?)
- scientific article; zbMATH DE number 3259550 (Why is no real title available?)
- scientific article; zbMATH DE number 3257595 (Why is no real title available?)
- scientific article; zbMATH DE number 3270345 (Why is no real title available?)
- scientific article; zbMATH DE number 3272827 (Why is no real title available?)
- scientific article; zbMATH DE number 3284927 (Why is no real title available?)
- scientific article; zbMATH DE number 3281211 (Why is no real title available?)
- scientific article; zbMATH DE number 3282977 (Why is no real title available?)
- scientific article; zbMATH DE number 3286662 (Why is no real title available?)
- scientific article; zbMATH DE number 3296819 (Why is no real title available?)
- scientific article; zbMATH DE number 3302908 (Why is no real title available?)
- scientific article; zbMATH DE number 3308846 (Why is no real title available?)
- scientific article; zbMATH DE number 3308855 (Why is no real title available?)
- scientific article; zbMATH DE number 3312218 (Why is no real title available?)
- scientific article; zbMATH DE number 3321476 (Why is no real title available?)
- scientific article; zbMATH DE number 3321690 (Why is no real title available?)
- scientific article; zbMATH DE number 3326170 (Why is no real title available?)
- scientific article; zbMATH DE number 3328649 (Why is no real title available?)
- scientific article; zbMATH DE number 3335465 (Why is no real title available?)
- scientific article; zbMATH DE number 3338133 (Why is no real title available?)
- scientific article; zbMATH DE number 3340762 (Why is no real title available?)
- scientific article; zbMATH DE number 3341819 (Why is no real title available?)
- scientific article; zbMATH DE number 3343615 (Why is no real title available?)
- scientific article; zbMATH DE number 3347916 (Why is no real title available?)
- scientific article; zbMATH DE number 3350641 (Why is no real title available?)
- scientific article; zbMATH DE number 3354103 (Why is no real title available?)
- scientific article; zbMATH DE number 3354119 (Why is no real title available?)
- scientific article; zbMATH DE number 3354513 (Why is no real title available?)
- scientific article; zbMATH DE number 3354526 (Why is no real title available?)
- scientific article; zbMATH DE number 3356467 (Why is no real title available?)
- scientific article; zbMATH DE number 3361691 (Why is no real title available?)
- scientific article; zbMATH DE number 3366710 (Why is no real title available?)
- scientific article; zbMATH DE number 3382096 (Why is no real title available?)
- scientific article; zbMATH DE number 3402375 (Why is no real title available?)
- scientific article; zbMATH DE number 3400681 (Why is no real title available?)
- scientific article; zbMATH DE number 3405685 (Why is no real title available?)
- scientific article; zbMATH DE number 3416582 (Why is no real title available?)
- Iterationsverfahren für einige nichtlineare Probleme mit Nebenbedingungen
- Iterative Saddle Point Techniques
- Iterative Solution of Nonlinear Optimal Control Problems
- La méthode des centres dans un espace topologique
- Multiplier and gradient methods
- Méthodes numériques pour la décomposition et la minimisation de fonctions non différentiables
- Méthodes pour la recherche de points de selle
- Newton's method for convex programming and Tschebyscheff approximation
- Nonlinear programming -- a survey
- Nonlinear Programming: A Numerical Survey
- On a Method of Courant for Minimizing Functionals
- On iterative methods for solving nonlinear least squares problems over convex sets
- On penalty function methods for nonlinear programming problems
- On the Convergence of Gradient Methods under Constraint
- On the convergence of sequential minimization algorithms
- On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
- On the method of multipliers for mathematical programming problems
- On the theory of maximin problems
- Optimierung unter Nebenbedingungen. Struktur einer Klasse von Algorithmen. I
- Optimization by Least Squares
- Penalty function versus non-penalty function methods for constrained nonlinear programming problems
- Projection methods for non-linear programming
- Rate of Convergence of a Class of Methods of Feasible Directions
- Sequential gradient-restoration algorithm for the minimization of constrained functions. Ordinary and conjugate gradient versions
- Steepest Ascent for Large Scale Linear Programs
- Technical Note—Theorems of Convergence for Improved Nonlinear Programming Algorithms
- The Conjugate Residual Method for Constrained Minimization Problems
- The Created Response Surface Technique for Optimizing Nonlinear, Restrained Systems
- The Decomposition Algorithm for Linear Programs
- The Generalized Penalty-Function/Surrogate Model
- The Gradient Projection Method Along Geodesics
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
- The Gradient Projection Method under Mild Differentiability Conditions
- The multiplier method of Hestenes and Powell applied to convex programming
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- The restoration of constraints in holonomic and nonholonomic problems
- The Supporting Hyperplane Method for Unimodal Programming
- Variational methods for the solution of problems of equilibrium and vibrations
- Über einige Näherungsverfahren zur Lösung nichtlinearer Variationsungleichungen und konvexer Minimumprobleme mit Nebenbedingungen
This page was built for publication: Minimization methods with constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1234628)
