The following pages link to (Q4103334):
Displaying 36 items.
- A novel Frank-Wolfe algorithm. Analysis and applications to large-scale SVM training (Q508681) (← links)
- An active-set algorithmic framework for non-convex optimization problems over the simplex (Q782910) (← links)
- Lower subdifferentiable functions and their minimization by cutting planes (Q795741) (← links)
- A comparison of feasible direction methods for the stochastic transportation problem (Q989847) (← links)
- ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems (Q1016355) (← links)
- Finiteness in restricted simplicial decomposition (Q1069859) (← links)
- Solving general continuous single facility location problems by cutting planes (Q1086129) (← links)
- Interactive algorithm for multiobjective optimization (Q1145628) (← links)
- A cutting-plane algorithm with linear and geometric rates of convergence (Q1147491) (← links)
- The gap function of a convex program (Q1165158) (← links)
- Current state of the art of algorithms and computer software for geometric programming (Q1243249) (← links)
- The empirical performance of a polynomial algorithm for constrained nonlinear optimization (Q1309871) (← links)
- A regularization of the Frank-Wolfe method and unification of certain nonlinear programming methods (Q1338143) (← links)
- The convergence of equilibrium algorithms with non-monotone line search technique. (Q1415258) (← links)
- Numerical implementation of two nonconforming finite element methods for unilateral contact (Q1573309) (← links)
- Computational methods for optimum design of large complex systems (Q1820022) (← links)
- Performance analysis of greedy algorithms for minimising a maximum mean discrepancy (Q2104022) (← links)
- Avoiding bad steps in Frank-Wolfe variants (Q2111475) (← links)
- Frank-Wolfe and friends: a journey into projection-free first-order optimization methods (Q2240671) (← links)
- Rank-two update algorithm versus Frank-Wolfe algorithm with away steps for the weighted Euclidean one-center problem (Q2301135) (← links)
- A sparse control approach to optimal sensor placement in PDE-constrained parameter estimation problems (Q2334623) (← links)
- Linearly convergent away-step conditional gradient for non-strongly convex functions (Q2364483) (← links)
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids (Q2381536) (← links)
- A heuristic algorithm for network equilibration (Q2490221) (← links)
- An extension of Gilbert's algorithm for computing optimal controls (Q2542011) (← links)
- A bundle-type algorithm for routing in telecommunication data networks (Q2655403) (← links)
- Revisiting the approximate Carathéodory problem via the Frank-Wolfe algorithm (Q2689818) (← links)
- On the von Neumann and Frank--Wolfe Algorithms with Away Steps (Q2789610) (← links)
- An Extended Frank--Wolfe Method with “In-Face” Directions, and Its Application to Low-Rank Matrix Completion (Q2968175) (← links)
- An algorithm for nonlinear programs over Cartesian product sets (Q3348713) (← links)
- Linear convergence of accelerated conditional gradient algorithms in spaces of measures (Q4999535) (← links)
- Quadratures over graphs via the Frank-Wolfe method and its variant (Q5047125) (← links)
- Polytope Conditioning and Linear Convergence of the Frank–Wolfe Algorithm (Q5219705) (← links)
- Riemannian optimization via Frank-Wolfe methods (Q6038651) (← links)
- The Frank-Wolfe algorithm: a short introduction (Q6118086) (← links)
- First-order methods for convex optimization (Q6169988) (← links)
