Pages that link to "Item:Q2532487"
From MaRDI portal
The following pages link to Sequential gradient-restoration algorithm for the minimization of constrained functions. Ordinary and conjugate gradient versions (Q2532487):
Displayed 46 items.
- Optimal round trip lunar missions based on the patched-conic approximation (Q338274) (← links)
- An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints (Q461441) (← links)
- A globalization scheme for the generalized Gauss-Newton method (Q582820) (← links)
- Local convergence of an inexact-restoration method and numerical experiments (Q850815) (← links)
- Optimal starting conditions for the rendezvous maneuver. II: Mathematical programming approach (Q933832) (← links)
- On minimax eigenvalue problems via constrained optimization (Q1090242) (← links)
- Properties of the sequential gradient-restoration algorithm (SGRA). I: Introduction and comparison with related methods (Q1106733) (← links)
- Properties of the sequential gradient-restoration algorithm (SGRA). II: Convergence analysis (Q1106734) (← links)
- Minimizing a differentiable function over a differential manifold (Q1151825) (← links)
- Periodically preconditioned conjugate gradient-restoration algorithm (Q1176836) (← links)
- A class of quadratically convergent algorithms for constrained function minimization (Q1211414) (← links)
- Minimization methods with constraints (Q1234628) (← links)
- A computational method for minimization with nonlinear constraints (Q1240025) (← links)
- The prerestorative step in the sequential gradient-restoration algorithm for mathematical programming problems with inequality constraints (Q1241018) (← links)
- On the optimization of constrained functions: Comparison of sequential gradient-restoration algorithm and gradient-projection algorithm (Q1241259) (← links)
- CGS algorithms for constrained extremization of functions (Q1246254) (← links)
- Test example for nonlinear programming codes (Q1252157) (← links)
- A geometric method in nonlinear programming (Q1253613) (← links)
- Convergence to a second-order point of a trust-region algorithm with a nonmonotonic penalty parameter for constrained optimization (Q1359463) (← links)
- Optimal trajectories for Earth-to-Mars flight (Q1379928) (← links)
- Two-phase model algorithm with global convergence for nonlinear programming (Q1389083) (← links)
- Sequential conjugate gradient-restoration algorithm for optimal control problems. I: Theory (Q1393853) (← links)
- An interior-point method for solving box-constrained underdetermined nonlinear systems (Q1763761) (← links)
- Numerical experience with conjugate direction methods in constrained minimization (Q1825773) (← links)
- A trust-region algorithm for equality-constrained optimization via a reduced dimension approach. (Q1872933) (← links)
- Optimal two-impulse trajectories with moderate flight time for Earth-Moon missions (Q1955429) (← links)
- Inexact-restoration algorithm for constrained optimization (Q1973486) (← links)
- Minimum fuel trajectories for round trip lunar missions (Q1993639) (← links)
- Multiobjective approximate gradient projection method for constrained vector optimization: sequential optimality conditions without constraint qualifications (Q2122022) (← links)
- Non-monotone inexact restoration method for nonlinear programming (Q2191795) (← links)
- Interplanetary patched-conic approximation with an intermediary swing-by maneuver with the Moon (Q2313830) (← links)
- A study of Earth-Moon trajectories based on analytical expressions for the velocity increments (Q2313872) (← links)
- A flexible inexact-restoration method for constrained optimization (Q2346395) (← links)
- Euler discretization and inexact restoration for optimal control (Q2471093) (← links)
- Modified quasilinearization and optimal initial choise of the multipliers. I: Mathematical programming problems (Q2538326) (← links)
- Modifications and extensions of the conjugate gradient-restoration algorithm for mathematical programming problems (Q2542010) (← links)
- Use of the augmented penalty function in mathematical programming problems. II. Conjugate gradient-restoration algorithm (Q2543396) (← links)
- Modifications and extensions of the conjugate gradient-restoration algorithm for mathematical programming problem (Q2544702) (← links)
- Constrained optimization problems using multiplier methods (Q2544875) (← links)
- A pseudo Newton-Raphson method for function minimization (Q2551308) (← links)
- On the method of multipliers for mathematical programming problems (Q2552449) (← links)
- Solution Of Bounded Nonlinear Systems Of Equations Using Homotopies With Inexact Restoration (Q4805935) (← links)
- A constraint-space conjugate gradient method for function minimization and optimal control problems† (Q5634533) (← links)
- The projection operator applied to gradient methods for solving optimal control problems with terminal state constraints (Q5663007) (← links)
- Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming. (Q5958076) (← links)
- Inexact restoration for minimization with inexact evaluation both of the objective function and the constraints (Q6076246) (← links)