[1] A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion

[2] Inventory management for dual sales channels with inventory-level-dependent demand

[3] An efficient algorithm of Yau-Yau method for solving nonlinear filtering problems

[4] An optimal mean-reversion trading rule under a markov chain model

[5] On the Generalized Lanczos Trust-Region Method

[6] An efficient numerical method for solving high-dimensional nonlinear filtering problems

[7] The risk-averse newsvendor game with competition on demand

[8] A globally convergent algorithm for nonconvex optimization based on block coordinate update

[9] An Optimal Strategy for Pairs Trading Under Geometric Brownian Motions

[10] EXTRA: An exact first-order algorithm for decentralized consensus optimization

[11] Accelerated first-order primal-dual proximal methods for linearly constrained composite convex programming

[12] Calculus of the Exponent of Kurdyka–Łojasiewicz Inequality and Its Applications to Linear Convergence of First-Order Methods

[13] A New Primal–Dual Algorithm for Minimizing the Sum of Three Functions with a Linear Operator

[14] Inertial Proximal ADMM for Linearly Constrained Separable Convex Optimization

[15] A TVSCAD approach for image deblurring with impulsive noise

[16] The semismooth-related properties of a merit function and a descent method for the nonlinear complementarity problem

[17] General forms of finite population central limit theorems with applications to causal inference

[18] On Recent Advance of Nonlinear Filtering Theory: Emphases on Global Approaches

[19] On the generalized Fischer-Burmeister merit function for the second-order cone complementarity problem

[20] A Krylov subspace method for the large-scale second-order cone complementarity problem

[21] Decentralized dynamic optimization through the alternating direction method of multipliers

[22] Trace ratio optimization with an application to multi-view learning

[23] Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization

[24] DLM: Decentralized linearized alternating direction method of multipliers

[25] Global Convergence of ADMM in Nonconvex Nonsmooth Optimization

[26] On Generalizing Trace Minimization Principles

[27] Impact of demand price elasticity on advantages of cooperative advertising in a two-tier supply chain

[28] ARock: an Algorithmic Framework for Asynchronous Parallel Coordinate Updates

[29] Convergence rate analysis for averaged fixed point iterations in common fixed point problems

[30] Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems

[31] On the convergence of decentralized gradient descent

[32] Fast L1–L2 Minimization via a Proximal Operator

[33] Minimization and parameter estimation for seminorm regularization models with I -divergence constraints

[34] Sparse regularization: convergence of iterative jumping thresholding algorithm

[35] Kurdyka- Lojasiewicz exponent via inf-projection

[36] Duopoly Game of Callable Products in Airline Revenue Management

[37] Scheduling under Linear Constraints

[38] Large time average of reachable sets and Applications to Homogenization of interfaces moving with oscillatory spatio-temporal velocity

[39] Douglas–Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems

[40] Coordinate-friendly structures, algorithms and applications

[41] Global Convergence of Splitting Methods for Nonconvex Composite Optimization

[42] Maximizing Sum of Coupled Traces with Applications

[43] Low-M-Rank Tensor Completion and Robust Tensor PCA

[44] Constrained Total Variation Deblurring Models and Fast Algorithms Based on Alternating Direction Method of Multipliers

[45] An efficient matrix splitting method for the second-order cone complementarity problem

[46] A Nuclear-norm Model for Multi-Frame Super-Resolution Reconstruction from Video Clips

[47] A Two-Stage Image Segmentation Method Using a Convex Variant of the Mumford--Shah Model and Thresholding

[48] Mathematical model of adult stem cell regeneration with cross-talk between genetic and epigenetic regulation

[49] Linear convergence of adaptively iterative thresholding algorithms for compressed sensing

[50] Stochastic Quasi-Newton Methods for Nonconvex Stochastic Optimization

[51] An online convex optimization approach to proactive network resource allocation

[52] Block stochastic gradient iteration for convex and nonconvex optimization

[53] Proper Orthogonal Decomposition Method to Nonlinear Filtering Problems in Medium-High Dimension

[54] Semidefinite Relaxations for Best Rank-1 Tensor Approximations

[55] A semidefinite program approach for computing the maximum eigenvalue of a class of structured tensors and its applications in hypergraphs and copositivity test

[56] Phase transitions for modified Erdős–Rényi processes

[57] RSA: Byzantine-robust stochastic aggregation methods for distributed learning from heterogeneous datasets

[58] An Efficient Algorithm for Min-Max Convex Semi-Infinite Programming Problems

[59] Meanfield games and model predictive control

[60] Communication-censored ADMM for decentralized consensus optimization

[61] Novel Suboptimal Filter via Higher Order Central Moments

[62] Platform modelling and scheduling game with multiple intelligent cloud-computing pools for big data

[63] Suboptimal Linear Estimation for Continuous-discrete Bilinear Systems

[64] Noise correlation bounds for uniform low degree functions

[65] Numerical methods for mean field games based on Gaussian processes and Fourier features

[66] Convergence rate analysis for the higher order power method in best rank one approximations of tensors

[67] Target Identification Using Dictionary Matching of Generalized Polarization Tensors

[68] Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis

[69] Online learning in optical tomography: a stochastic approach

[70] On the linear convergence of the alternating direction method of multipliers

[71] On the linear convergence of the ADMM in decentralized consensus optimization

[72] A Novel Suboptimal Method for Solving Polynomial Filtering Problems

[73] The suboptimal method via probabilists' Hermite polynomials to solve nonlinear filtering problems

[74] Maximization of the sum of the trace ratio on the Stiefel manifold, I: Theory

[75] Upper tails for counting objects in randomly induced subhypergraphs and rooted random graphs

[76] Distributed Non-Convex First-Order Optimization and Information Processing: Lower Complexity Bounds and Rate Optimal Algorithms

[77] Long and short paths in uniform random recursive dags

[78] Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights

[79] An efficient threshold dynamics method for topology optimization for fluids

[80] Run-and-Inspect Method for Nonconvex Optimization and Global Optimality Bounds for R-Local Minimizers

[81] On Nonconvex Decentralized Gradient Descent

[82] Direct method for time-varying nonlinear filtering

[83] Direct method for Yau filtering system with nonlinear observations

[84] Real-Time Solution of Time-Varying Yau Filtering Problems via Direct Method

[85] One condition for solution uniqueness and robustness of both l1-synthesis and l1-analysis minimizations

[86] An efficient algorithm for second-order cone linear complementarity problems

[87] Error bounds for parametric polynomial systems with applications to higher-order stability analysis and convergence rates

[88] Generalized high-dimensional trace regression via nuclear norm regularization

[89] The convex and monotone functions associated with second-order cone

[90] Neural networks based on three classes of NCP-functions for solving nonlinear complementarity problems

[91] Maximization of the sum of the trace ratio on the Stiefel manifold, II: Computation

[92] Complete Real Time Solution of the General Nonlinear Filtering Problem without Memory

[93] Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems

[94] Asymptotics for the size of the largest component scaled to “log$n$” in inhomogeneous random graphs

[95] Percolation in invariant Poisson graphs with i.i.d. degrees

[96] Computation Algorithm for Convex Semi-infinite Program with Second-Order Cones: Special Analyses for Affine and Quadratic Case

[97] On the Convergence of Asynchronous Parallel Iteration with Unbounded Delays

[98] An unconstrained smooth minimization reformulation of the second-order cone complementarity problem

[99] A nested Lanczos method for the trust-region subproblem

[100] Federated variance-reduced stochastic gradient descent with robustness to Byzantine attacks

[101] The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent

[102] A damped Gauss-Newton method for the second-order cone complementarity problem

[103] New Classes of Finite Dimensional Filters with Non-Maximal Rank

[104] A Lanczos method for large-scale extreme Lorentz eigenvalue problems

[105] A Tensor Analogy of Yuan’s Theorem of the Alternative and Polynomial Optimization with Sign structure

[106] Distributed optimization and statistical learning via the alternating direction method of multipliers

[107] An alternative approach for a distance inequality associated with the second-order cone and the circular cone

[108] Finite dimensional estimation algebras with state dimension 3 and rank 2, I--linear structure of wong matrix

[109] Obstacle problem for von Karman equations

[110] Two classes of merit functions for the second-order cone complementarity problem

[111] First-order methods for constrained convex programming based on linearized augmented Lagrangian function

[112] Discovery of new complementarity functions for NCP and SOCCP

[113] Tight Coefficients of Averaged Operators via Scaled Relative Graph

[114] Analysis of the Convergence Rate for the Cyclic Projection Algorithm Applied to Basic Semialgebraic Convex Sets

[115] Tightness and Equivalence of Semidefinite Relaxations for MIMO Detection

[116] A Scalable Algorithm for Large-scale Unsupervised Multi-view Partial Least Squares

[117] A new merit function and its related properties for the second-order cone complementarity problem

[118] A note on alternating projections for ill-posed semidefinite feasibility problems

[119] Multi-view Orthonormalized Partial Least Squares: Regularizations and Deep Extensions

[120] The novel classes of finite dimensional filters with non-maximal rank estimation algebra on state dimension four and rank of one

[121] Pric ing of Mortgage- Backed Se cu ri ties with Option- Adjusted Spread

[122] Further relationship between second-order cone and positive semidefinite matrix cone

[123] Some Finite Dimensional Filters derived from the Structure Theorem for Five-dimensional Estimation Algebras

[124] A Self-Consistent-Field Iteration for Orthogonal Canonical Correlation Analysis

[125] Decomposition methods for computing directional stationary solutions of a class of nonsmooth nonconvex optimization problems

[126] Localization, Stability, and Resolution of Topological Derivative Based Imaging Functionals in Elasticity

[127] Can primal methods outperform primal-dual methods in decentralized dynamic optimization?

[128] Hermite Spectral Method to 1D Forward Kolmogorov Equation and its Application to Nonlinear Filtering Problems

[129] Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold

[130] On merit functions for p-order cone complementarity problem

[131] Gradient descent with random initialization: Fast global convergence for nonconvex phase retrieval

[132] Communication-censored linearized ADMM for decentralized consensus optimization

[133] Communication-censored distributed stochastic gradient descent

[134] Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization

[135] Decentralized consensus optimization with asynchrony and delays

[136] The price of fairness with the extended Perles-Maschler solution

[137] Alternating proximal gradient method for sparse nonnegative Tucker decomposition

[138] A class of interior proximal-like algorithms for convex second-order cone programming

[139] Topological Data Assimilation using Wasserstein Distance

[140] A note on convexity of two signomial functions

[141] On the Lorentz cone complementarity problems in infinite-dimensional real Hilbert space

[142] Strong semismoothness of Fischer-Burmeister complementarity function associated with symmetric cone

[143] Analysis of nonsmooth vector-valued functions associated with infinite-dimensional second-order cones

[144] Nearly Optimal Stochastic Approximation for Online Principal Subspace Estimation

[145] An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming

[146] Alternating direction method of multipliers for regularized multiclass support vector machines

[147] A one-parametric class of merit functions for the second-order cone complementarity problem

[148] Interior proximal methods and central paths for convex second-order cone programming

[149] Global and Local Structure Preserving Sparse Subspace Learning: An Iterative Approach to Unsupervised Feature Selection

[150] Simultaneous redundant via insertion and line end extension for yield optimization

[151] Robust group lasso: Model and recoverability

[152] Characterizations of solution sets of cone-constrained convex programming problems

[153] A family of NCP functions and a descent method for the nonlinear complementarity problem

[154] Smooth and nonsmooth analyses of vector-valued functions associated with circular cones

[155] Necessary conditions for multiobjective optimal control problems with free end-time

[156] The penalized Fischer-Burmeister SOC complementarity function

[157] A proximal point algorithm for the monotone second-order cone complementarity problem

[158] Probabilistic Structure Learning for EEG/MEG Source Imaging with Hierarchical Graph Prior

[159] New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors

[160] On the existence of saddle points for nonlinear second-order cone programming problems

[161] Two classes of merit functions for infinite-dimensional second order complimentary problems

[162] Necessary conditions for multiobjective optimal control problems with state constraints

[163] A new class of penalized NCP-functions and its properties

[164] Growth behavior of two classes of merit functions for symmetric cone complementarity problems

[165] Conditions for error bounds and bounded level sets of some merit functions for the second-order cone complementarity problem

[166] A linearly convergent derivative-free descent method for the second-order cone complementarity problem

[167] A Semismooth Newton based Augmented Lagrangian Method for Nonsmooth Optimization on Matrix Manifolds

[168] Learn-and-adapt stochastic dual gradients for network resource allocation

[169] The intrinsic Toeplitz structure and its applications in algebraic Riccati equations

[170] Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems

[171] A one-parametric class of merit functions for the symmetric cone complementarity problem

[172] A regularization method for the second-order cone complementarity problem with the Cartesian P0-property

[173] Automatic constraint detection for 2D layout regularization.

[174] Constructions of complementarity functions and merit functions for circular cone complementarity problem

[175] Symmetrization of generalized natural residual function for NCP

[176] Stationary point conditions for the FB merit function associated with symmetric cones

[177] Alternating direction augmented Lagrangian methods for semidefinite programming

[178] Proximal point algorithm for nonlinear complementarity problem based on the generalized fischer-burmeister merit function

[179] An R-linearly convergent derivative-free algorithm for nonlinear complementarity problems based on the generalized FischerBurmeister merit function

[180] A proximal gradient descent method for the extended second-order cone linear complementarity problem

[181] Iteratively reweighted algorithms for compressive sensing

[182] A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation

[183] A descent method for a reformulation of the second-order cone complementarity problem