Pages that link to "Item:Q2541105"

The following pages link to Minimization of functions having Lipschitz continuous first partial derivatives (Q2541105):

Displayed 50 items.

• The method of successive orthogonal projections for solving nonlinear simultaneous equations (Q579851) ‎ (← links)
• A Newton method for linear programming (Q704747) ‎ (← links)
• A Kalman-tracking filter approach to nonlinear programming (Q750314) ‎ (← links)
• A new three-term conjugate gradient method (Q761255) ‎ (← links)
• The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis (Q790580) ‎ (← links)
• An \(\epsilon\)-active barrier-function method for solving minimax problems (Q806678) ‎ (← links)
• Convergence of descent method with new line search (Q815995) ‎ (← links)
• Convergence of quasi-Newton method with new inexact line search (Q819030) ‎ (← links)
• New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems (Q849738) ‎ (← links)
• Convergence of the Polak-Ribiére-Polyak conjugate gradient method (Q869834) ‎ (← links)
• Global convergence properties of two modified BFGS-type methods (Q874351) ‎ (← links)
• New conjugacy condition and related new conjugate gradient methods for unconstrained optimization (Q875393) ‎ (← links)
• Convergence of Liu-Storey conjugate gradient method (Q881512) ‎ (← links)
• Global optimization using a synchronization of multiple search points autonomously driven by a chaotic dynamic model (Q933798) ‎ (← links)
• Newton's method for the common eigenvector problem (Q935799) ‎ (← links)
• Convergence of PRP method with new nonmonotone line search (Q945382) ‎ (← links)
• A modified BFGS method and its superlinear convergence in nonconvex minimization with general line search rule (Q949372) ‎ (← links)
• Multi-modal control using adaptive motion description languages (Q958297) ‎ (← links)
• Convergent stepsizes for constrained optimization algorithms (Q1061005) ‎ (← links)
• On the convergence of curvilinear search algorithms in unconstrained optimization (Q1061006) ‎ (← links)
• Location problems with costs being sums of powers of Euclidean distances (Q1086127) ‎ (← links)
• A stochastic steepest-descent algorithm (Q1093541) ‎ (← links)
• A truncated Newton method with non-monotone line search for unconstrained optimization (Q1095799) ‎ (← links)
• A stochastic algorithm using one sample point per iteration and diminishing step-sizes (Q1102867) ‎ (← links)
• Properties of the sequential gradient-restoration algorithm (SGRA). II: Convergence analysis (Q1106734) ‎ (← links)
• Stepsize analysis for descent methods (Q1133148) ‎ (← links)
• A generalized direct search acceptable-point technique for use with descent-type multivariate algorithms (Q1138482) ‎ (← links)
• The Weber problem revisited (Q1151240) ‎ (← links)
• An algorithm for linearly constrained nonlinear programming problems (Q1151830) ‎ (← links)
• Constrained optimization along geodesics (Q1160888) ‎ (← links)
• An algorithm for solving linearly constrained minimax problems (Q1169406) ‎ (← links)
• A least-distance programming procedure for minimization problems under linear constraints (Q1170113) ‎ (← links)
• Partitioned quasi-Newton methods for nonlinear equality constrained optimization (Q1184335) ‎ (← links)
• Mesh independence of Newton-like methods for infinite dimensional problems (Q1184926) ‎ (← links)
• A barrier function method for minimax problems (Q1186276) ‎ (← links)
• A new conic method for unconstrained minimization (Q1197422) ‎ (← links)
• A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization (Q1205504) ‎ (← links)
• A globally convergent algorithm for the Euclidean multiplicity location problem (Q1210269) ‎ (← links)
• Accelerating procedures for methods of conjugate directions (Q1217583) ‎ (← links)
• On the rate of convergence of some feasible direction algorithms (Q1221697) ‎ (← links)
• On the Pironneau-Polak method of centers (Q1221698) ‎ (← links)
• Convexity, monotonicity, and gradient processes in Hilbert space (Q1223622) ‎ (← links)
• Approximation methods for the unconstrained optimization (Q1234630) ‎ (← links)
• An accelerated conjugate direction method to solve linearly constrained minimization problems (Q1235063) ‎ (← links)
• Feasible directions in economic policy (Q1240138) ‎ (← links)
• Numerically stable computation of step-sizes for descent methods. The nonconvex case (Q1241019) ‎ (← links)
• Conditional gradient algorithms with open loop step size rules (Q1244889) ‎ (← links)
• The effect of data grid size on certain interpolation methods for unconstrained function minimization (Q1247723) ‎ (← links)
• Nonoptimal termination properties of quadratic interpolation univariate searches (Q1249520) ‎ (← links)
• In favor of conjugate directions: a generalized acceptable-point algorithm for function minimization (Q1255894) ‎ (← links)