The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Constrained optimization: Projected gradient flows
- Global optimization of robust chance constrained problems
- An approximation-concepts approach to shape optimal design
- The integral yield criterion of finite elements and its application of limit analysis and optimization problems of thin-walled elastic-plastic structures
- 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
- An algorithm for Ramsey pricing by multiproduct public firms under incomplete information
- An efficient curvilinear method for the minimization of a nonlinear function subject to linear inequality constraints
- Distributed-parameter optimal control via mathematical programming
- Minimizing a differentiable function over a differential manifold
- An algorithm for linearly constrained nonlinear programming problems
- Constrained optimization along geodesics
- Nonlinear total variation based noise removal algorithms
- A method for the configurational optimisation of structures
- Minimization methods with constraints
- 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
- Implementation of gradient methods by tangential discretization
- A geometric method in nonlinear programming
- Numerische Berechnung extremaler Fundamentalsysteme für Polynomräume über der Vollkugel. (Calculation of extremal fundamental systems for polynomial spaces over the unit ball)
- Capturing the behavior of bubbles and drops using the variational level set approach
- A feasible descent cone method for linearly constrained minimization problems
- A convergence of ODE method in constrained optimization
- Two-phase model algorithm with global convergence for nonlinear programming
- Solving a system of infinitely many fuzzy inequalities with piecewise linear membership functions
- An interior-point method for solving box-constrained underdetermined nonlinear systems
- Computational methods for optimum design of large complex systems
- Global convergence of Rosen's gradient projection method
- Solution of nonlinear two-point boundary-value problems using spline functions
- Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization
- Inexact-restoration algorithm for constrained optimization
- Vertex assigned morphing for parameter free shape optimization of 3-dimensional solid structures
- First order optimality conditions and steepest descent algorithm on orthogonal Stiefel manifolds
- Convergence of a distributed method for minimizing sum of convex functions with fixed point constraints
- Multiobjective approximate gradient projection method for constrained vector optimization: sequential optimality conditions without constraint qualifications
- Fractional derivative based nonlinear diffusion model for image denoising
- The multiproximal linearization method for convex composite problems
- A combined penalty function and gradient projection method for nonlinear programming
- A flexible inexact-restoration method for constrained optimization
- A new method for solving conditioned maxima problems
- Pattern separation by convex programming
- Minimization of convex functions on the convex hull of a point set
- A generalized super-memory gradient projection method of strongly sub-feasible directions with strong convergence for nonlinear inequality constrained optimization
- Euler discretization and inexact restoration for optimal control
- Conjugate gradient-type algorithms for frictional multi-contact problems: applications to granular materials
- Comparison of some methods used for process identification
- The restoration of constraints in holonomic and nonholonomic problems
- Nonlinear programming: Global use of the Lagrangian
- Nonlinear programming: A quadratic analysis of ridge paralysis
- Modified quasilinearization and optimal initial choise of the multipliers. I: Mathematical programming problems
- Indefinite quadratic fractional functional programming
- Projection method for solving a singular system of linear equations and its applications
- 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
- An exact penalty function based on the projection matrix
- A robust and high precision optimal explicit guidance scheme for solid motor propelled launch vehicles with thrust and drag uncertainty
- An interior-point algorithm for the minimization arising from 3D contact problems with friction
- The geodesic dynamic relaxation method for problems of equilibrium with equality constraint conditions
- A convergence theorem of Rosen’s gradient projection method
- Modulus methods for nonnegatively constrained image restoration
- 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 projected preconditioned conjugate gradient algorithm for computing many extreme eigenpairs of a Hermitian matrix
- Decentralized Cooperative Optimization for Multi-criteria Decision Making
- GPGCD: an iterative method for calculating approximate GCD of univariate polynomials
- A differential equation approach to nonlinear programming
- State parameterization approach to the solution of optimal control problems
- On the application of deterministic and stochastic programming methods to problems of economics;Mathematische Programmierung und ihre Anwendung auf die Wirtschaft
- Minimal-order compensators for decoupling and arbitrary pole placement in linear multivariable systems
- Simplicial decomposition in nonlinear programming algorithms
- A lower bound for the controlling parameters of the exact penalty functions
- FEASIBLE DESCENT CONE METHODS FOR INEQUALITY CONSTRAINED OPTIMIZATION PROBLEMS
- A projected gradient and constraint linearization method for nonlinear model predictive control
- Mathematical and metaheuristic applications in design optimization of steel frame structures: an extensive review
- Solution Of Bounded Nonlinear Systems Of Equations Using Homotopies With Inexact Restoration
- On the linear convergence of the approximate proximal splitting method for non-smooth convex optimization
- Knot tightening by constrained gradient descent
- Low-rank retractions: a survey and new results
- Riemannian multigrid line search for low-rank problems
- A modified gradient projection method for static and dynamic topology optimization
- Inexact primal-dual gradient projection methods for nonlinear optimization on convex set
- Convex programming with separable ellipsoidal constraints: application in contact problems with orthotropic friction
- Identification of point sets by quasidifferentiable functions
- Equivalence in nonlinear programming
- A 3D SHAPE OPTIMIZATION PROBLEM IN HEAT TRANSFER: ANALYSIS AND APPROXIMATION VIA BEM
- Indefinite cubic programming with standard errors in objective function
- scientific article; zbMATH DE number 3272790 (Why is no real title available?)
- Mathematical programming applied to linear approximation of functions
- Programming with a special class of nonlinear functionals
- Optimierung in der Stichprobentheorie durch Schichtung und Aufteilung
- Penalty function versus non-penalty function methods for constrained nonlinear programming problems
- Nota sobre programacion lineal estocastica: Evolucion y estado actual. (I)
- Remarks on the convergence of Rosen's gradient projection method
- Discussion on the convergence of Rosen's gradient projection method
- The steepest descent gravitational method for linear programming
- Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming.
- Inexact restoration for minimization with inexact evaluation both of the objective function and the constraints
- Constrained extremum seeking of a MIMO dynamic system
- An approximate gradient-type method for nonlinear symmetric equations with convex constraints
- New hybrid perturbed projected gradient and simulated annealing algorithms for global optimization
- An efficient algorithm for reconstruction images corrupted by some multiplicative noises
This page was built for publication: The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5639532)
