A geometric method in nonlinear programming
From MaRDI portal
Cites work
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- A class of quadratically convergent algorithms for constrained function minimization
- A new approach to constrained function optimization
- A variable metric algorithm for constrained minimization based on an augmented Lagrangian
- An exact penalty function for nonlinear programming with inequalities
- Continuous Newton-Raphson method for solving and underdetermined system of nonlinear equations
- Diagonalized multiplier methods and quasi-Newton methods for constrained optimization
- Extremization of functions with equality constraints
- Global analysis of continuous analogues of the Levenberg-Marquardt and Newton-Raphson methods for solving nonlinear equations
- scientific article; zbMATH DE number 3147710 (Why is no real title available?)
- scientific article; zbMATH DE number 3159112 (Why is no real title available?)
- scientific article; zbMATH DE number 3707270 (Why is no real title available?)
- scientific article; zbMATH DE number 3480387 (Why is no real title available?)
- scientific article; zbMATH DE number 3520162 (Why is no real title available?)
- scientific article; zbMATH DE number 3436937 (Why is no real title available?)
- scientific article; zbMATH DE number 3800875 (Why is no real title available?)
- scientific article; zbMATH DE number 3801319 (Why is no real title available?)
- scientific article; zbMATH DE number 3293562 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- scientific article; zbMATH DE number 3309655 (Why is no real title available?)
- scientific article; zbMATH DE number 3402374 (Why is no real title available?)
- scientific article; zbMATH DE number 3408831 (Why is no real title available?)
- scientific article; zbMATH DE number 3409146 (Why is no real title available?)
- Methods for Modifying Matrix Factorizations
- Multiplier and gradient methods
- Multiplier methods: A survey
- On the combination of the multiplier method of Hestenes and Powell with Newton's method
- On the Convergence of the Conjugate Gradient Method for Singular Linear Operator Equations
- On the method of multipliers for mathematical programming problems
- Penalty function versus non-penalty function methods for constrained nonlinear programming problems
- Sequential gradient-restoration algorithm for the minimization of constrained functions. Ordinary and conjugate gradient versions
- The Created Response Surface Technique for Optimizing Nonlinear, Restrained Systems
- The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
- The multiplier method of Hestenes and Powell applied to convex programming
- The Solution of Nonlinear Systems of Equations by A-Stable Integration Techniques
- Unconstrained approach to the extremization of constrained functions
- Widely Convergent Method for Finding Multiple Solutions of Simultaneous Nonlinear Equations
Cited in
(32)- Constrained optimization: Projected gradient flows
- Primal central paths and Riemannian distances for convex sets
- Global analysis of continuous analogues of the Levenberg-Marquardt and Newton-Raphson methods for solving nonlinear equations
- Minimizing a differentiable function over a differential manifold
- Gradient systems associated with probability distributions
- Stable barrier-projection and barrier-Newton methods in linear programming
- An ODE method of solving nonlinear programming
- A convergence of ODE method in constrained optimization
- On the stability of globally projected dynamical systems
- Global existence of real roots and random Newton flow algorithm for nonlinear system of equations
- Distributed constrained optimization via continuous-time mirror design
- An optimization framework of biological dynamical systems
- Nonlinear coordinate representations of smooth optimization problems
- Geometric notes on optimization with equality constraints
- Explicit pseudo-transient continuation and the trust-region updating strategy for unconstrained optimization
- Continuation methods with the trusty time-stepping scheme for linearly constrained optimization with noisy data
- The regularization continuation method with an adaptive time step control for linearly constrained optimization problems
- An adaptive Newton-method based on a dynamical systems approach
- Riemannian optimization and multidisciplinary design optimization
- Adaptive Newton-type schemes based on projections
- Continuous algorithms for solution of convex optimization problems and finding saddle points of contex-coneave functions with the use of projection operations
- Minimum problems on differentiable manifolds
- GPGCD: an iterative method for calculating approximate GCD of univariate polynomials
- Continuous Newton-Raphson method for solving and underdetermined system of nonlinear equations
- Continuous analogue to iterative optimization for PDE-constrained inverse problems
- Null space gradient flows for constrained optimization with applications to shape optimization
- Gradient Flow Finite Element Discretisations with Energy-Based Adaptivity for Excited States of Schrödinger's Equation
- The regularization continuation method for optimization problems with nonlinear equality constraints
- A subdivision method for computing nearest gcd with certification
- Geometric design of the tangent term in landing algorithms for orthogonality constraints
- A gradient-flow approach for combined layout-control design of wave energy parks
- EM algorithms for optimization problems with polynomial objectives
This page was built for publication: A geometric method in nonlinear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1253613)