Non-Linear Programming

145 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

coMobile: real-time human mobility modeling at urban scale using multi-view learning (2015, methodology): “2 Iterative Learning We develop an iterative learning technique based on the block coordinate descent [2] to solve this optimization.”
A Survey on Truth Discovery (2015, methodology): “To derive a solution, coordinate descent [7] can be adopted, in which one set of variables are ﬁxed in order to solve for the other set of variables.”
A Convex Feature Learning Formulation for Latent Task Structure Discovery (2012, unknown): “…(4) restricted to W. Note that (4) has a simple constraint set, which is a simplex and the gradient ∇H(γ) can be computed using the Danskin’s theorem (Bertsekas, 1999): the ith component of this sub-gradient is given by (∇H(γ))i = −d q i γ −q i 2q̄ × (∑ w∈V λw(γ) (∑k j=1 ( β̄>Kjwβ̄ )p̄) q̄p̄)…”
A Robust Predictive Control Design for Nonlinear Active Suspension Systems (2016, methodology): “The simplest method of enforcing stability with a finite prediction horizon is to add a so-called terminal equality constraint at the end of the prediction horizon [27,28], i.”