arbiter
JournalsPricingAccount
← All journals

Computational Optimization and Applications

Springer Nature

Operations & Tech
AJG 3
Abstract coverage—see Methodology
Recent paperssorted by most recent
PaperYearCitations
Parallel block coordinate descent methods with identification strategies
Ronaldo Lopes et al.
20261 citations
Subgradient-based tableau pivot method for sparse signal recovery
Xiaoli Hu et al.
20260 citations
A derivative-free Levenberg–Marquardt method for sparse nonlinear least squares problems
Yuchen Feng et al.
20260 citations
Computing the convex envelope of bivariate piecewise linear-quadratic functions in linear time
Tanmaya Karmarkar & Yves Lucet
20260 citations
Tractable hierarchies of convex relaxations for polynomial optimization on the nonnegative orthant
Ngoc Hoang Anh Mai et al.
20260 citations
Correction: Exploiting negative curvature in conjunction with adaptive sampling: theoretical results and a practical algorithm
Albert S. Berahas et al.
20260 citations
A unified optimization framework for multiclass classification with structured hyperplane arrangements
Víctor Blanco et al.
20260 citations
Revisiting Extragradient-Type Methods: Part 1—Generalizations and Sublinear Convergence Rates
Quoc Tran-Dinh & Nghia Nguyen-Trung
20260 citations
FIRM: federated image reconstruction using multimodal tomographic data
Geunyeong Byeon et al.
20260 citations
Effectively leveraging momentum terms in stochastic line search frameworks for fast optimization of finite-sum problems
Matteo Lapucci & Davide Pucci
20260 citations
Structured nonsmooth optimization using functional encoding and branching information
Fengqiao Luo
20260 citations
A symmetric primal-dual method with double extrapolation for composite convex optimization involving three functions
Ling Zhou & Feng Ma
20260 citations
Exact and heuristic algorithms for constrained biclustering
Antonio M. Sudoso
20260 citations
Weighting method for non-preemptive multi-objective mathematical programming
Leonardo Ferro et al.
20260 citations
A natural SQP method with potentially infeasible subproblems for nonlinear optimization
Wenhao Fu & Yu-Hong Dai
20260 citations
General inertial proximal gradient method with gradient extrapolation for nonconvex nonsmooth optimization problems
Tanxing Wang et al.
20260 citations
Verifying Robustness of Neural Networks with Tight Semidefinite Relaxations
Godai Azuma et al.
20260 citations
Scalable approximate optimal diagonal preconditioning
Wenzhi Gao et al.
20260 citations
Domain decomposition for entropic unbalanced optimal transport
Ismael Medina et al.
20260 citations
A linesearch-type normal map-based semismooth Newton method for nonsmooth nonconvex composite optimization
Hanfeng Zeng et al.
20260 citations

Search evidence from this journal →

Start a search

Access requires your institution's subscription. Ask your librarian →