Sequential gradient-restoration algorithm for the minimization of constrained functions. Ordinary and conjugate gradient versions

DOI10.1007/BF00927947zbMath0174.14403OpenAlexW2029071607WikidataQ113108491 ScholiaQ113108491MaRDI QIDQ2532487

Ho-Yi Huang, J. C. Heideman, Angelo Miele

Publication date: 1969

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00927947

zbMATH Keywords

ordinary differential equations

Related Items (46)

A trust-region algorithm for equality-constrained optimization via a reduced dimension approach. ⋮ Multiobjective approximate gradient projection method for constrained vector optimization: sequential optimality conditions without constraint qualifications ⋮ On minimax eigenvalue problems via constrained optimization ⋮ Solution Of Bounded Nonlinear Systems Of Equations Using Homotopies With Inexact Restoration ⋮ Local convergence of an inexact-restoration method and numerical experiments ⋮ Convergence to a second-order point of a trust-region algorithm with a nonmonotonic penalty parameter for constrained optimization ⋮ 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 ⋮ Optimal round trip lunar missions based on the patched-conic approximation ⋮ Optimal trajectories for Earth-to-Mars flight ⋮ A constraint-space conjugate gradient method for function minimization and optimal control problems† ⋮ Two-phase model algorithm with global convergence for nonlinear programming ⋮ Sequential conjugate gradient-restoration algorithm for optimal control problems. I: Theory ⋮ Inexact restoration for minimization with inexact evaluation both of the objective function and the constraints ⋮ Non-monotone inexact restoration method for nonlinear programming ⋮ The projection operator applied to gradient methods for solving optimal control problems with terminal state constraints ⋮ Minimizing a differentiable function over a differential manifold ⋮ Optimal two-impulse trajectories with moderate flight time for Earth-Moon missions ⋮ An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints ⋮ Periodically preconditioned conjugate gradient-restoration algorithm ⋮ Optimal starting conditions for the rendezvous maneuver. II: Mathematical programming approach ⋮ Inexact-restoration algorithm for constrained optimization ⋮ Euler discretization and inexact restoration for optimal control ⋮ Minimum fuel trajectories for round trip lunar missions ⋮ An interior-point method for solving box-constrained underdetermined nonlinear systems ⋮ A class of quadratically convergent algorithms for constrained function minimization ⋮ Minimization methods with constraints ⋮ A globalization scheme for the generalized Gauss-Newton method ⋮ A computational method for minimization with nonlinear 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 ⋮ Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming. ⋮ CGS algorithms for constrained extremization of functions ⋮ Test example for nonlinear programming codes ⋮ A geometric method in nonlinear programming ⋮ Modified quasilinearization and optimal initial choise of the multipliers. I: Mathematical programming problems ⋮ Modifications and extensions of the conjugate gradient-restoration algorithm for mathematical programming problems ⋮ Use of the augmented penalty function in mathematical programming problems. II. Conjugate gradient-restoration algorithm ⋮ Modifications and extensions of the conjugate gradient-restoration algorithm for mathematical programming problem ⋮ Constrained optimization problems using multiplier methods ⋮ Interplanetary patched-conic approximation with an intermediary swing-by maneuver with the Moon ⋮ A study of Earth-Moon trajectories based on analytical expressions for the velocity increments ⋮ A pseudo Newton-Raphson method for function minimization ⋮ Numerical experience with conjugate direction methods in constrained minimization ⋮ On the method of multipliers for mathematical programming problems ⋮ A flexible inexact-restoration method for constrained optimization

Cites Work

• Unnamed Item
• Unnamed Item
• The restoration of constraints in holonomic and nonholonomic problems
• Function minimization by conjugate gradients
• Methods of conjugate gradients for solving linear systems

This page was built for publication: Sequential gradient-restoration algorithm for the minimization of constrained functions. Ordinary and conjugate gradient versions