An overview of nonlinear optimization
From MaRDI portal
Recommendations
Cites work
- R-linear convergence of the Barzilai and Borwein gradient method
- A Barzilai-Borwein conjugate gradient method
- A dual approach to solving nonlinear programming problems by unconstrained optimization
- A globally convergent primal-dual interior-point relaxation method for nonlinear programs
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A new stepsize for the steepest descent method
- A new technique for inconsistent QP problems in the SQP method
- A nonlinear conjugate gradient algorithm with an optimal property and an improved Wolfe line search
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A nonmonotone conjugate gradient algorithm for unconstrained optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties
- A penalty-free method with superlinear convergence for equality constrained optimization
- A penalty-interior-point algorithm for nonlinear constrained optimization
- A perfect example for the BFGS method
- A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs
- A Rapidly Convergent Descent Method for Minimization
- A Robust Algorithm for Optimization with General Equality and Inequality Constraints
- A sequential quadratic optimization algorithm with rapid infeasibility detection
- A Subspace Study on Conjugate Gradient Algorithms
- A successive quadratic programming algorithm with global and superlinear convergence properties
- A surperlinearly convergent algorithm for constrained optimization problems
- Algorithm 851
- An efficient hybrid conjugate gradient method for unconstrained optimization
- An improved Dai-Kou conjugate gradient algorithm for unconstrained optimization
- An Interior Point Algorithm for Large-Scale Nonlinear Programming
- An interior-point algorithm for nonconvex nonlinear programming
- Analysis of monotone gradient methods
- Convergence analysis of nonlinear conjugate gradient methods
- Convergence of DFP algorithm
- Convergence Properties of Nonlinear Conjugate Gradient Methods
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Efficient hybrid conjugate gradient techniques
- Equipping the Barzilai-Borwein method with the two dimensional quadratic termination property
- Failure of global convergence for a class of interior point methods for nonlinear programming
- Function minimization by conjugate gradients
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Gradient methods with adaptive step-sizes
- Greedy quasi-Newton methods with explicit superlinear convergence
- scientific article; zbMATH DE number 6610411 (Why is no real title available?)
- scientific article; zbMATH DE number 3843083 (Why is no real title available?)
- scientific article; zbMATH DE number 3735056 (Why is no real title available?)
- scientific article; zbMATH DE number 88930 (Why is no real title available?)
- scientific article; zbMATH DE number 3583207 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 1131479 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 3278849 (Why is no real title available?)
- scientific article; zbMATH DE number 3309655 (Why is no real title available?)
- scientific article; zbMATH DE number 2221955 (Why is no real title available?)
- scientific article; zbMATH DE number 3067835 (Why is no real title available?)
- Implementation of a robust SQP algorithm
- Infeasibility Detection and SQP Methods for Nonlinear Optimization
- Methods of conjugate gradients for solving linear systems
- Minimization of functions having Lipschitz continuous first partial derivatives
- Multiplier and gradient methods
- New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
- New conjugacy conditions and related nonlinear conjugate gradient methods
- Nonlinear programming without a penalty function or a filter
- Nonlinear programming without a penalty function.
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- On a successive transformation of probability distribution and its application to the analysis of the optimum gradient method
- On the asymptotic behaviour of some new gradient methods
- On the asymptotic directions of the s-dimensional optimum gradient method
- On the Barzilai and Borwein choice of steplength for the gradient method
- On the Convergence of a New Conjugate Gradient Algorithm
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- On the Least Q-order of Convergence of Variable Metric Algorithms
- On the superlinear local convergence of a filter-SQP method
- Parallel software for training large scale support vector machines on multiprocessor systems
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- The conjugate gradient method in extremal problems
- The Limited Memory Conjugate Gradient Method
- The watchdog technique for forcing convergence in algorithms for constrained optimization
- Two-Point Step Size Gradient Methods
- Variable Metric Method for Minimization
This page was built for publication: An overview of nonlinear optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6200213)
