scientific article; zbMATH DE number 3526459
From MaRDI portal
Publication:4103334
zbMath0336.90045MaRDI QIDQ4103334
Publication date: 1970
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Convex programming (90C25) Nonlinear programming (90C30) Rate of convergence, degree of approximation (41A25) Methods of successive quadratic programming type (90C55)
Related Items
Linearly convergent away-step conditional gradient for non-strongly convex functions, Solving general continuous single facility location problems by cutting planes, A regularization of the Frank-Wolfe method and unification of certain nonlinear programming methods, Quadratures over graphs via the Frank-Wolfe method and its variant, Frank--Wolfe Methods with an Unbounded Feasible Region and Applications to Structured Learning, Some comments on Wolfe's ‘away step’, On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids, Unnamed Item, A bundle-type algorithm for routing in telecommunication data networks, Riemannian optimization via Frank-Wolfe methods, The Frank-Wolfe algorithm: a short introduction, Interactive algorithm for multiobjective optimization, A cutting-plane algorithm with linear and geometric rates of convergence, First-order methods for convex optimization, Revisiting the approximate Carathéodory problem via the Frank-Wolfe algorithm, An Extended Frank--Wolfe Method with “In-Face” Directions, and Its Application to Low-Rank Matrix Completion, Note on a method of conjugate subgradients for minimizing nondifferentiable functions, The convergence of equilibrium algorithms with non-monotone line search technique., Active Set Complexity of the Away-Step Frank--Wolfe Algorithm, The gap function of a convex program, A central cutting plane algorithm for the convex programming problem, Convergence conditions for restarted conjugate gradient methods with inaccurate line searches, Practical convergence conditions for the Davidon-Fletcher-Powell method, Frank-Wolfe and friends: a journey into projection-free first-order optimization methods, A novel Frank-Wolfe algorithm. Analysis and applications to large-scale SVM training, Finding the nearest point in A polytope, A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization, A heuristic algorithm for network equilibration, Unnamed Item, An algorithm for nonlinear programs over Cartesian product sets, On the von Neumann and Frank--Wolfe Algorithms with Away Steps, A comparison of feasible direction methods for the stochastic transportation problem, Current state of the art of algorithms and computer software for geometric programming, Rank-two update algorithm versus Frank-Wolfe algorithm with away steps for the weighted Euclidean one-center problem, ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems, Polytope Conditioning and Linear Convergence of the Frank–Wolfe Algorithm, An extension of Gilbert's algorithm for computing optimal controls, Computational methods for optimum design of large complex systems, First-order Methods for the Impatient: Support Identification in Finite Time with Convergent Frank--Wolfe Variants, Generalized Conditional Gradient for Sparse Estimation, Numerical implementation of two nonconforming finite element methods for unilateral contact, An active-set algorithmic framework for non-convex optimization problems over the simplex, Linear convergence of accelerated conditional gradient algorithms in spaces of measures, A sparse control approach to optimal sensor placement in PDE-constrained parameter estimation problems, Lower subdifferentiable functions and their minimization by cutting planes, The empirical performance of a polynomial algorithm for constrained nonlinear optimization, Performance analysis of greedy algorithms for minimising a maximum mean discrepancy, Avoiding bad steps in Frank-Wolfe variants, An extension of the frank and Wolfe method of feasible directions, Finiteness in restricted simplicial decomposition
