The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
From MaRDI portal
Publication:5639532
DOI10.1137/0109044zbMath0231.90048OpenAlexW2264885058MaRDI QIDQ5639532
Publication date: 1961
Published in: Journal of the Society for Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0109044
Related Items
Inexact restoration for minimization with inexact evaluation both of the objective function and the constraints, Constrained extremum seeking of a MIMO dynamic system, Penalty function versus non-penalty function methods for constrained nonlinear programming problems, An approximate gradient-type method for nonlinear symmetric equations with convex constraints, Nota sobre programacion lineal estocastica: Evolucion y estado actual. (I), New hybrid perturbed projected gradient and simulated annealing algorithms for global optimization, Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming., Indefinite cubic programming with standard errors in objective function, Multiobjective approximate gradient projection method for constrained vector optimization: sequential optimality conditions without constraint qualifications, An exact penalty function based on the projection matrix, A feasible descent cone method for linearly constrained minimization problems, FEASIBLE DESCENT CONE METHODS FOR INEQUALITY CONSTRAINED OPTIMIZATION PROBLEMS, The integral yield criterion of finite elements and its application of limit analysis and optimization problems of thin-walled elastic-plastic structures, Solution Of Bounded Nonlinear Systems Of Equations Using Homotopies With Inexact Restoration, Modulus Methods for Nonnegatively Constrained Image Restoration, A modified gradient projection method for static and dynamic topology optimization, Local convergence of an inexact-restoration method and numerical experiments, Fractional derivative based nonlinear diffusion model for image denoising, Properties of the sequential gradient-restoration algorithm (SGRA). I: Introduction and comparison with related methods, Properties of the sequential gradient-restoration algorithm (SGRA). II: Convergence analysis, Programming with a special class of nonlinear functionals, Projection gradient method for energy functional minimization with a constraint and its application to computing the ground state of spin-orbit-coupled Bose-Einstein condensates, A new method for solving conditioned maxima problems, A projected preconditioned conjugate gradient algorithm for computing many extreme eigenpairs of a Hermitian matrix, Pattern separation by convex programming, Identification of point sets by quasidifferentiable functions, A Projected Gradient and Constraint Linearization Method for Nonlinear Model Predictive Control, An algorithm for Ramsey pricing by multiproduct public firms under incomplete information, A convergence of ODE method in constrained optimization, Equivalence in nonlinear programming, GPGCD: an iterative method for calculating approximate GCD of univariate polynomials, Two-phase model algorithm with global convergence for nonlinear programming, An efficient curvilinear method for the minimization of a nonlinear function subject to linear inequality constraints, The geodesic dynamic relaxation method for problems of equilibrium with equality constraint conditions, Optimierung in der Stichprobentheorie durch Schichtung und Aufteilung, The multiproximal linearization method for convex composite problems, Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization, Distributed-parameter optimal control via mathematical programming, Minimizing a differentiable function over a differential manifold, An algorithm for linearly constrained nonlinear programming problems, Minimization of convex functions on the convex hull of a point set, On the application of deterministic and stochastic programming methods to problems of economics;Mathematische Programmierung und ihre Anwendung auf die Wirtschaft, Constrained optimization along geodesics, On Rosen's gradient projection methods, Unnamed Item, Mathematical and metaheuristic applications in design optimization of steel frame structures: an extensive review, Inexact-restoration algorithm for constrained optimization, On the linear convergence of the approximate proximal splitting method for non-smooth convex optimization, A generalized super-memory gradient projection method of strongly sub-feasible directions with strong convergence for nonlinear inequality constrained optimization, Low-rank retractions: a survey and new results, Inexact primal–dual gradient projection methods for nonlinear optimization on convex set, Vertex assigned morphing for parameter free shape optimization of 3-dimensional solid structures, Decentralized Cooperative Optimization for Multi-criteria Decision Making, Euler discretization and inexact restoration for optimal control, Knot Tightening by Constrained Gradient Descent, Modification of Karmarkar's projective scaling algorithm, Nonconcave utility maximisation in the MIMO broadcast channel, A convergence theorem of Rosen’s gradient projection method, An interior-point method for solving box-constrained underdetermined nonlinear systems, First order optimality conditions and steepest descent algorithm on orthogonal Stiefel manifolds, Minimal-order compensators for decoupling and arbitrary pole placement in linear multivariable systems, GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials, A combined penalty function and gradient projection method for nonlinear programming, Simplicial decomposition in nonlinear programming algorithms, A method for the configurational optimisation of structures, Conjugate gradient-type algorithms for frictional multi-contact problems: applications to granular materials, Mathematical programming applied to linear approximation of functions, Remarks on the convergence of Rosen's gradient projection method, Discussion on the convergence of Rosen's gradient projection method, Minimization methods with constraints, The steepest descent gravitational method for linear programming, The prerestorative step in the sequential gradient-restoration algorithm for mathematical programming problems with inequality constraints, On the optimization of constrained functions: Comparison of sequential gradient-restoration algorithm and gradient-projection algorithm, Nonlinear total variation based noise removal algorithms, A projection gradient method for computing ground state of spin-2 Bose-Einstein condensates, A differential equation approach to nonlinear programming, Implementation of gradient methods by tangential discretization, A geometric method in nonlinear programming, A lower bound for the controlling parameters of the exact penalty functions, Numerische Berechnung extremaler Fundamentalsysteme für Polynomräume über der Vollkugel. (Calculation of extremal fundamental systems for polynomial spaces over the unit ball), Comparison of some methods used for process identification, The restoration of constraints in holonomic and nonholonomic problems, Nonlinear programming: Global use of the Lagrangian, A robust and high precision optimal explicit guidance scheme for solid motor propelled launch vehicles with thrust and drag uncertainty, Nonlinear programming: A quadratic analysis of ridge paralysis, Modified quasilinearization and optimal initial choise of the multipliers. I: Mathematical programming problems, Constrained optimization: Projected gradient flows, Computational methods for optimum design of large complex systems, Global optimization of robust chance constrained problems, Indefinite quadratic fractional functional programming, A 3D SHAPE OPTIMIZATION PROBLEM IN HEAT TRANSFER: ANALYSIS AND APPROXIMATION VIA BEM, Projection method for solving a singular system of linear equations and its applications, Global convergence of Rosen's gradient projection method, Convergence of a distributed method for minimizing sum of convex functions with fixed point constraints, A method of feasible directions using function approximations, with applications to min max problems, Capturing the behavior of bubbles and drops using the variational level set approach, A general approach to one-step iterative methods with application to eigenvalue problems, Riemannian Multigrid Line Search for Low-Rank Problems, Solution of nonlinear two-point boundary-value problems using spline functions, State parameterization approach to the solution of optimal control problems, An approximation-concepts approach to shape optimal design, Solving a system of infinitely many fuzzy inequalities with piecewise linear membership functions, Subgradient projection algorithm. II, A flexible inexact-restoration method for constrained optimization, An interior-point algorithm for the minimization arising from 3D contact problems with friction, Minimization of quadratic functionals on cones in Hilbert spaces, Convex Programming with Separable Ellipsoidal Constraints: Application in Contact Problems with Orthotropic Friction
