Linear and Nonlinear Programming

By D. Luenberger, Yinyu Ye. International Series in Operations Research and Management Science, 2021

733 citations recorded by the source corpus.

Subfields: Control and Systems Engineering, Numerical Analysis

View Paper: https://www.semanticscholar.org/paper/87f750aa109281c8c7d559c66bb0ccfbb896439d

Citations in the corpus

• An investigation of Newton-Sketch and subsampled Newton methods (2017, unknown): “, d, generated by the CG method satisfy [12] ||p − p||A ≤ ( λd−r+1 − λ1 λd−r+1 + λ1 )2 ‖p − p||A, where Ap∗ = b.”
• Equilibrium optimizer: A novel optimization algorithm (2020, unknown): “Linear and nonlinear programming [1,2] are some of the most commonly used deterministic methods, characterized by using the gradient information of the problem to search the space and find the solution.”