On squared-variable formulations

DOI10.1137/23M1608343MaRDI QIDQ6911548zbMATH OpenFDO

Authors Lijun Ding, Stephen J. Wright

Publication date 24 October 2025

Published in SIAM Journal on Optimization (Search for Journal in Brave)

zbMATH Keywords

inequality-constrained optimizationbound-constrained optimizationsquared-slack variablessquared-variable formulations

Mathematics Subject Classification ID

Linear programming (90C05) Nonlinear programming (90C30) Abstract computational complexity for mathematical programming problems (90C60)

Cites work

• scientific article; zbMATH DE number 1818892 (Why is no real title available?)
• scientific article; zbMATH DE number 3717147 (Why is no real title available?)
• scientific article; zbMATH DE number 1160037 (Why is no real title available?)
• scientific article; zbMATH DE number 3793774 (Why is no real title available?)
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• scientific article; zbMATH DE number 5223994 (Why is no real title available?)
• scientific article; zbMATH DE number 964349 (Why is no real title available?)
• A NOTE ON THE SQUARED SLACK VARIABLES TECHNIQUE FOR NONLINEAR OPTIMIZATION
• A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees
• A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization
• A stable approach to Newton's method for general mathematical programming problems in R\(^n\)
• Beyond Procrustes: Balancing-Free Gradient Descent for Asymmetric Low-Rank Matrix Sensing
• Complexity of proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints
• Convergence of the Iterates of Descent Methods for Analytic Cost Functions
• Lasso, fractional norm and structured sparse estimation using a Hadamard product parametrization
• Numerical Optimization
• On the Implementation of a Primal-Dual Interior Point Method
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization
• Optimization over convex polyhedra via Hadamard parametrizations
• PCx: an interior-point code for linear programming
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Stochastic subgradient method converges on tame functions
• The Geometry of Algorithms with Orthogonality Constraints

This page was built for publication: On squared-variable formulations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6911548)