On Degenerate Doubly Nonnegative Projection Problems (Q5868954): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 18:41, 30 December 2024

scientific article; zbMATH DE number 7592375

Language	Label	Description	Also known as
English	On Degenerate Doubly Nonnegative Projection Problems	scientific article; zbMATH DE number 7592375

Statements

scholarly article

0 references

On Degenerate Doubly Nonnegative Projection Problems (English)

0 references

0 references

0 references

0 references

0 references

Mathematics of Operations Research

0 references

publication date

26 September 2022

0 references

full work available at URL

https://arxiv.org/abs/2009.11272

0 references

zbMATH Keywords

doubly nonnegative cone

0 references

semidefinite programming

0 references

augmented Lagrangian method

0 references

semismooth Newton

0 references

degeneracy

0 references

metric subregularity

0 references

describes a project that uses

0 references

0 references

MaRDI profile type

0 references

ON MATRICES DEPENDING ON PARAMETERS

0 references

0 references

Norms and exclusion theorems

0 references

On Projection Algorithms for Solving Convex Feasibility Problems

0 references

Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization

0 references

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems

0 references

On copositive programming and standard quadratic optimization problems

0 references

0 references

On the copositive representation of binary and continuous nonconvex quadratic programs

0 references

Quadratic Growth Conditions for Convex Matrix Optimization Problems Associated with Spectral Functions

0 references

Computing the Best Approximation over the Intersection of a Polyhedral Set and the Doubly Nonnegative Cone

0 references

On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming

0 references

Approximation of the Stability Number of a Graph via Copositive Programming

0 references

On the computational complexity of membership problems for the completely positive cone and its dual

0 references

Implicit Functions and Solution Mappings

0 references

Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods

0 references

An Algorithm for Restricted Least Squares Regression

0 references

Finite-Dimensional Variational Inequalities and Complementarity Problems

0 references

A cyclic projection algorithm via duality

0 references

Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming

0 references

A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems

0 references

Combined Primal–Dual and Penalty Methods for Convex Programming

0 references

QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming

0 references

On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization

0 references

A simple characterization of solutions sets of convex programs

0 references

On the Matrix Equation <i>X</i>′<i>X</i> = <i>A</i>

0 references

Some NP-complete problems in quadratic and nonlinear programming

0 references

0 references

A Copositive Programming Approach to Graph Partitioning

0 references

Copositive and semidefinite relaxations of the quadratic assignment problem

0 references

0 references

Some continuity properties of polyhedral multifunctions

0 references

Local structure of feasible sets in nonlinear programming, part II: Nondegeneracy

0 references

Constraint Nondegeneracy in Variational Analysis

0 references

0 references

Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming

0 references

Variational Analysis

0 references

Sensitivity analysis of generalized equations

0 references

The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications

0 references

Semismooth Matrix-Valued Functions

0 references

Approximation accuracy, gradient methods, and error bound for structured convex optimization

0 references

SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints

0 references

A Newton-CG Augmented Lagrangian Method for Semidefinite Programming

0 references

A unified approach to error bounds for structured convex optimization problems

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

10.1287/MOOR.2021.1205

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5868954

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5868954&oldid=39652549"