DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Line search
Line search
Lec9p1, ORF363/COS323
Use of the NLPQLP Sequential Quadratic Programming Algorithm to Solve Rotorcraft Aeromechanical Constrained Optimisation Problems
A Sequential Quadratic Programming Algorithm with an Additional Equality Constrained Phase
Strongly Polynomial Algorithm for the Intersection of a Line with a Polymatroid Jean Fonlupt, Alexandre Skoda
Hybrid Algorithms for On-Line and Combinatorial Optimization Problems
Mechanical Identification of Materials and Structures with Optical Methods
Sequential Quadratic Programming Methods∗
An Efficient Sequential Quadratic Programming Algorithm For
NORTHWESTERN UNIVERSITY Inexact Sequential Quadratic
Subgradient Based Multiple-Starting-Point Algorithm for Non-Smooth Optimization of Analog Circuits
Modified Nonmonotone Armijo Line Search for Descent Method
Coordinate Descent Heuristics for the Irregular Strip Packing Problem of Rasterized Shapes
Gauss–Newton Optimization for Phase Recovery from the Bispectrum James L
A Multi-Layer Line Search Method to Improve the Initialization of Optimization Algorithms Benjamin Ivorra, Bijan Mohammadi, Angel Manuel Ramos
15. Quasi-Newton Methods
Painless Stochastic Gradient: Interpolation, Line-Search, and Convergence Rates
Lbfgs: Efficient L-BFGS and OWL-QN Optimization in R
A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization∗
Top View
Random Search Algorithms
Line Search Algorithms
Line Search Methods for Unconstrained Optimisation
4.5.3 Variants of Newton's Method 4.5.4 Gauss Newton Approximation
3 Solving Problems by Searching
Line Search Algorithms for Locally Lipschitz Functions on Riemannian Manifolds
(Quasi-)Newton Methods
A Theoretical and Experimental Study of the Broyden-Fletcher-Goldfarb-Shano (BFGS) Update
Gradient Descent Revisited
A Machine Learning Based Meta-Heuristic Approach for Constrained Continuous Optimization
Heuristic Algorithms and Learning Techniques: Applications to the Graph Coloring Problem
BFGS Method: a New Search Direction (Kaedah BFGS: Arah Carian Baharu)
RIMS-1812 Minimizing Submodular Functions on Diamonds Via
Quasi-Newton Optimization Methods for Deep Learning Applications
Deep Reinforcement Learning Through Policy Optimization
Metaheuristic Design of Feedforward Neural Networks: a Review of Two Decades of Research Arxiv:1705.05584V1 [Cs.NE] 16 May
Quasi-Newton Methods
Analysis of the Gradient Method with an Armijo-Wolfe Line Search on a Class of Nonsmooth Convex Functions
Optimal Power Flow Paper 4: Survey of Approaches to Solving the ACOPF
Line Search and Trust-Region Methods for Convex-Composite
10. Unconstrained Minimization
Line Search and Convergence in Bound-Constrained Optimization
An Efficient Sequential Linear Quadratic Algorithm for Solving
Trust Region Policy Optimization (TRPO)
Lecture 5: Gradient Desent Revisited 5.1 Choose Step Size
Arxiv:1603.00522V1
Sequential Quadratic Programming
Line-Search Methods for Smooth Unconstrained Optimization
Nonmonotone Line Search Methods with Variable Sample Size
Derivative-Free Optimization Methods
A Sequential Quadratic Programming Algorithm with Non-Monotone Line Search
A Multi-Layer Line Search Method to Improve the Initialization of Optimization Algorithms
Choosing the Step Size: Intuitive Line Search Algorithms with Efficient Convergence
Ridge Rider: Finding Diverse Solutions by Following Eigenvectors of the Hessian
A New Descent Algorithm Using the Three-Step Discretization Method for Solving Unconstrained Optimization Problems
Chapter 3 Variable Neighborhood Search
A Sequential Quadratic Optimization Algorithm with Rapid Infeasibility Detection