Skip to main content Skip to main navigation menu Skip to site footer
  • Register
  • Login
  • Journals
  • Home
  • Editorial Board
  • Archives
  • Online First
  • Policies
    • Ethical Policy
    • The Use of Artificial Intelligence Policy
  • Guide for Authors
  • About
    • About the Journal
    • Order Journal
    • Contact Us
  • Register
  • Login
  1. Home /
  2. Search

Search

Advanced filters
Published After
Published Before

Search Results

##search.searchResults.foundPlural##
  • The Primal-Dual Potential Reduction Algorithm for Positive Semi-Definite Programming

    Si-Ming Huang
    2003-06-02
    32306 3382 Pages:339-346
  • A First-Order Splitting Method for Solving a Large-Scale Composite Convex Optimization Problem

    Yuchao Tang, Guorong Wu, Chuanxi Zhu
    2019-04-29
    42864 3034 Pages:666-688
  • A Primal-Dual Fixed Point Algorithm for Multi-Block Convex Minimization

    Peijing Chen, Jianguo Huang, Xiaoqun Zhang
    2021-07-01
    37436 3598 Pages:723-738
  • Nonlinear Lagrangians for Nonlinear Programming Based on Modified Fischer-Burmeister NCP Functions

    Yonghong Ren, Fangfang Guo, Yang Li
    2018-08-22
    36422 2807 Pages:396-414
  • A Symmetric Primal-Dual Algorithmic Framework for Saddle Point Problems

    Hongjin He, Kai Wang, Jintao Yu
    2025-11-19
    162 119
  • A Dual Algorithm for Minimizing a Quadratic Function with Two Quadratic Constraints

    Ya-Xiang Yuan
    2021-07-01
    33620 3664 Pages:348-359
  • Compute a Celis-Dennis-Tapia Step

    Gai-Di Li & Ya-Xiang Yuan
    2005-10-02
    33778 3498 Pages:463-478
  • A New Perturbation Simplex Algorithm for Linear Programming

    Ping-Qi Pan
    1999-06-02
    33305 3665 Pages:233-242
  • Extended Regularized Dual Averaging Methods for Stochastic Optimization

    Jonathan W. Siegel, Jinchao Xu
    2023-04-25
    27150 2521 Pages:525-541
  • Reduced Basis Method for Parametrized Elliptic Advection-Reaction Problems

    Luca Dedè
    2018-08-22
    36000 3923 Pages:122-148
  • An Optimal Method for Adjusting the Centering Parameter in the Wide-Neighborhood Primal-Dual Interior-Point Algorithm for Linear Programming

    Wenbao Ai
    2004-06-02
    32664 3285 Pages:437-446
  • An Inexact Proximal DC Algorithm for the Large-Scale Cardinality Constrained Mean-Variance Model in Sparse Portfolio Selection

    Mingcai Ding, Xiaoliang Song, Bo Yu
    2024-11-13
    13342 1245 Pages:1452-1501
  • A Stochastic Augmented Lagrangian Method for Stochastic Convex Programming

    Jiani Wang, Liwei Zhang
    2024-11-19
    13571 1051 Pages:315-344
  • Accelerated Symmetric ADMM and Its Applications in Large-Scale Signal Processing

    Jianchao Bai, Ke Guo, Junli Liang, Yang Jing, H.C. So
    2024-11-13
    12243 1259 Pages:1605-1626
  • Calculation of Penalties in Algorithm of Mixed Integer Programming Solving with Revised Dual Simplex Method for Bounded Variables

    Yi-Ming Wei, Qing-Huai Hu
    1999-10-02
    32724 3357 Pages:545-552
  • Primal Perturbation Simplex Algorithms for Linear Programming

    Ping-Qi Pan
    2021-07-01
    32000 3677 Pages:587-596
  • A Robust Interior Point Method for Computing the Analytic Center of an Ill-Conditioned Polytope with Errors

    Zhouhong Wang, Yuhong Dai, Fengmin Xu
    2021-07-01
    41476 4278 Pages:843-865
  • Error Estimates for Sparse Optimal Control Problems by Piecewise Linear Finite Element Approximation

    Xiaoliang Song, Bo Chen, Bo Yu
    2021-04-07
    41079 3265 Pages:471-492
  • Source Term Identification with Discontinuous Dual Reciprocity Approximation and Quasi-Newton Method from Boundary Observations

    El Madkouri Abdessamad, Ellabib Abdellatif
    2021-04-07
    42128 3284 Pages:311-332
  • An Interior Point Method for Linear Programming

    Zi-Luan Wei
    2021-07-01
    33081 3593 Pages:342-351
1 - 20 of 20 items
Global Science Press
Follow Us
Useful Links
  • Publish with Us
  • Browse Journals
  • Open Access
  • Ethical Policy
  • Terms and Conditions
Resources
  • Publish with Us
  • Partner with Us
  • For Authors
  • For Institutions
  • For Librarians
  • For Agents
  • For Users
  • Editorial Process
About
  • About Global Science Press
  • Contact Us