Large-Scale Matrix Optimization Problems.
- Published in:
- Innovation, 2014, v. 13, n. 2, p. 40
- By:
- Publication type:
- Article
Works matching AU Toh Kim-Chuan
Results: 45
1
2
Computation of condition numbers for linear programming problems using Peña’s method.
- Published in:
- Optimization Methods & Software, 2006, v. 21, n. 3, p. 419, doi. 10.1080/10556780500098599
- By:
- Publication type:
- Article
3
On proximal augmented Lagrangian based decomposition methods for dual block-angular convex composite programming problems.
- Published in:
- Computational Optimization & Applications, 2023, v. 86, n. 1, p. 117, doi. 10.1007/s10589-023-00493-0
- By:
- Publication type:
- Article
4
An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems.
- Published in:
- Computational Optimization & Applications, 2023, v. 85, n. 1, p. 107, doi. 10.1007/s10589-023-00459-2
- By:
- Publication type:
- Article
5
Subspace quadratic regularization method for group sparse multinomial logistic regression.
- Published in:
- Computational Optimization & Applications, 2021, v. 79, n. 3, p. 531, doi. 10.1007/s10589-021-00287-2
- By:
- Publication type:
- Article
6
A robust Lagrangian-DNN method for a class of quadratic optimization problems.
- Published in:
- Computational Optimization & Applications, 2017, v. 66, n. 3, p. 453, doi. 10.1007/s10589-016-9879-0
- By:
- Publication type:
- Article
7
A note on the convergence of ADMM for linearly constrained convex optimization problems.
- Published in:
- Computational Optimization & Applications, 2017, v. 66, n. 2, p. 327, doi. 10.1007/s10589-016-9864-7
- By:
- Publication type:
- Article
8
Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting.
- Published in:
- Computational Optimization & Applications, 2015, v. 60, n. 1, p. 171, doi. 10.1007/s10589-014-9663-y
- By:
- Publication type:
- Article
9
On solving a rank regularized minimization problem via equivalent factorized column-sparse regularized models.
- Published in:
- Mathematical Programming, 2025, v. 212, n. 1, p. 273, doi. 10.1007/s10107-024-02103-1
- By:
- Publication type:
- Article
10
Solving graph equipartition SDPs on an algebraic variety.
- Published in:
- Mathematical Programming, 2024, v. 204, n. 1/2, p. 299, doi. 10.1007/s10107-023-01952-6
- By:
- Publication type:
- Article
11
An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization.
- Published in:
- Mathematical Programming, 2023, v. 201, n. 1/2, p. 409, doi. 10.1007/s10107-022-01912-6
- By:
- Publication type:
- Article
12
Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints.
- Published in:
- Mathematical Programming, 2022, v. 193, n. 2, p. 761, doi. 10.1007/s10107-020-01594-y
- By:
- Publication type:
- Article
13
On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming.
- Published in:
- Mathematical Programming, 2021, v. 185, n. 1/2, p. 111, doi. 10.1007/s10107-019-01423-x
- By:
- Publication type:
- Article
14
On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope.
- Published in:
- Mathematical Programming, 2020, v. 179, n. 1/2, p. 419, doi. 10.1007/s10107-018-1342-9
- By:
- Publication type:
- Article
15
An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems.
- Published in:
- Mathematical Programming, 2020, v. 179, n. 1/2, p. 223, doi. 10.1007/s10107-018-1329-6
- By:
- Publication type:
- Article
16
On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming.
- Published in:
- Mathematical Programming, 2019, v. 178, n. 1/2, p. 381, doi. 10.1007/s10107-018-1300-6
- By:
- Publication type:
- Article
17
A block symmetric Gauss–Seidel decomposition theorem for convex composite quadratic programming and its applications.
- Published in:
- Mathematical Programming, 2019, v. 175, n. 1/2, p. 395, doi. 10.1007/s10107-018-1247-7
- By:
- Publication type:
- Article
18
Spectral operators of matrices.
- Published in:
- Mathematical Programming, 2018, v. 168, n. 1/2, p. 509, doi. 10.1007/s10107-017-1162-3
- By:
- Publication type:
- Article
19
Max-norm optimization for robust matrix recovery.
- Published in:
- Mathematical Programming, 2018, v. 167, n. 1, p. 5, doi. 10.1007/s10107-017-1159-y
- By:
- Publication type:
- Article
20
An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming.
- Published in:
- Mathematical Programming, 2017, v. 161, n. 1/2, p. 237, doi. 10.1007/s10107-016-1007-5
- By:
- Publication type:
- Article
21
A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems.
- Published in:
- Mathematical Programming, 2016, v. 156, n. 1/2, p. 161, doi. 10.1007/s10107-015-0874-5
- By:
- Publication type:
- Article
22
A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions.
- Published in:
- Mathematical Programming, 2016, v. 155, n. 1/2, p. 333, doi. 10.1007/s10107-014-0850-5
- By:
- Publication type:
- Article
23
A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems.
- Published in:
- Mathematical Programming, 2016, v. 155, n. 1/2, p. 435, doi. 10.1007/s10107-014-0853-2
- By:
- Publication type:
- Article
24
An introduction to a class of matrix cone programming.
- Published in:
- Mathematical Programming, 2014, v. 144, n. 1/2, p. 141, doi. 10.1007/s10107-012-0619-7
- By:
- Publication type:
- Article
25
An implementable proximal point algorithmic framework for nuclear norm minimization.
- Published in:
- Mathematical Programming, 2012, v. 133, n. 1/2, p. 399, doi. 10.1007/s10107-010-0437-8
- By:
- Publication type:
- Article
26
A constraint dissolving approach for nonsmooth optimization over the Stiefel manifold.
- Published in:
- IMA Journal of Numerical Analysis, 2024, v. 44, n. 6, p. 3717, doi. 10.1093/imanum/drad098
- By:
- Publication type:
- Article
27
An Inexact Halpern Iteration with Application to Distributionally Robust Optimization.
- Published in:
- Journal of Optimization Theory & Applications, 2025, v. 206, n. 3, p. 1, doi. 10.1007/s10957-025-02744-y
- By:
- Publication type:
- Article
28
On the Convergence Properties of a Majorized Alternating Direction Method of Multipliers for Linearly Constrained Convex Optimization Problems with Coupled Objective Functions.
- Published in:
- Journal of Optimization Theory & Applications, 2016, v. 169, n. 3, p. 1013, doi. 10.1007/s10957-016-0877-2
- By:
- Publication type:
- Article
29
Effect of footing width on N<sub>γ</sub> and failure envelope of eccentrically and obliquely loaded strip footings on sand.
- Published in:
- Canadian Geotechnical Journal, 2015, v. 52, n. 6, p. 694, doi. 10.1139/cgj-2013-0378
- By:
- Publication type:
- Article
30
Semi-proximal Augmented Lagrangian-Based Decomposition Methods for Primal Block-Angular Convex Composite Quadratic Conic Programming Problems.
- Published in:
- INFORMS Journal on Optimization, 2021, v. 3, n. 3, p. 254, doi. 10.1287/ijoo.2019.0048
- By:
- Publication type:
- Article
31
Dissolving Constraints for Riemannian Optimization.
- Published in:
- Mathematics of Operations Research, 2024, v. 49, n. 1, p. 366, doi. 10.1287/moor.2023.1360
- By:
- Publication type:
- Article
32
A Feasible Method for Solving an SDP Relaxation of the Quadratic Knapsack Problem.
- Published in:
- Mathematics of Operations Research, 2024, v. 49, n. 1, p. 19, doi. 10.1287/moor.2022.1345
- By:
- Publication type:
- Article
33
On Degenerate Doubly Nonnegative Projection Problems.
- Published in:
- Mathematics of Operations Research, 2022, v. 47, n. 3, p. 2219, doi. 10.1287/moor.2021.1205
- By:
- Publication type:
- Article
34
A New Homotopy Proximal Variable-Metric Framework for Composite Convex Minimization.
- Published in:
- Mathematics of Operations Research, 2022, v. 47, n. 1, p. 508, doi. 10.1287/moor.2021.1138
- By:
- Publication type:
- Article
35
Axisymmetric Lower-Bound Limit Analysis Using Finite Elements and Second-Order Cone Programming.
- Published in:
- Journal of Engineering Mechanics, 2014, v. 140, n. 2, p. 268, doi. 10.1061/(ASCE)EM.1943-7889.0000669
- By:
- Publication type:
- Article
36
Learning graph Laplacian with MCP.
- Published in:
- Optimization Methods & Software, 2024, v. 39, n. 3, p. 569, doi. 10.1080/10556788.2023.2269594
- By:
- Publication type:
- Article
37
A highly efficient algorithm for solving exclusive lasso problems.
- Published in:
- Optimization Methods & Software, 2024, v. 39, n. 3, p. 489, doi. 10.1080/10556788.2023.2253356
- By:
- Publication type:
- Article
38
A Newton-bracketing method for a simple conic optimization problem.
- Published in:
- Optimization Methods & Software, 2021, v. 36, n. 2/3, p. 371, doi. 10.1080/10556788.2020.1782906
- By:
- Publication type:
- Article
39
SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0).
- Published in:
- Optimization Methods & Software, 2020, v. 35, n. 1, p. 87, doi. 10.1080/10556788.2019.1576176
- By:
- Publication type:
- Article
40
Practical Matrix Completion and Corruption Recovery Using Proximal Alternating Robust Subspace Minimization.
- Published in:
- International Journal of Computer Vision, 2015, v. 111, n. 3, p. 315, doi. 10.1007/s11263-014-0746-0
- By:
- Publication type:
- Article
41
Block preconditioners for symmetric indefinite linear systems.
- Published in:
- International Journal for Numerical Methods in Engineering, 2004, v. 60, n. 8, p. 1361, doi. 10.1002/nme.982
- By:
- Publication type:
- Article
42
Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures.
- Published in:
- Journal of Global Optimization, 2020, v. 77, n. 3, p. 513, doi. 10.1007/s10898-020-00879-y
- By:
- Publication type:
- Article
43
Convergence Analysis of an Infeasible Interior Point Algorithm Based on a Regularized Central Path for Linear Complementarity Problems.
- Published in:
- Computational Optimization & Applications, 2004, v. 27, n. 3, p. 269, doi. 10.1023/B:COAP.0000013059.84424.af
- By:
- Publication type:
- Article
44
Fast Algorithms for Large-Scale Generalized Distance Weighted Discrimination.
- Published in:
- Journal of Computational & Graphical Statistics, 2018, v. 27, n. 2, p. 368, doi. 10.1080/10618600.2017.1366915
- By:
- Publication type:
- Article
45
A Convergent 3-Block Semi-Proximal ADMM for Convex Minimization Problems with One Strongly Convex Block.
- Published in:
- Asia-Pacific Journal of Operational Research, 2015, v. 32, n. 4, p. -1, doi. 10.1142/S0217595915500244
- By:
- Publication type:
- Article