An exact penalty approach for optimization with nonnegative orthogonality constraints
From MaRDI portal
Publication:2687065
DOI10.1007/s10107-022-01794-8OpenAlexW2965036497MaRDI QIDQ2687065
Publication date: 1 March 2023
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.12424
optimality conditionsecond-order methodconstraint qualificationexact penaltynonnegative orthogonality constraint
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A feasible method for optimization with orthogonality constraints
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- A line search exact penalty method using steering rules
- Perron-Frobenius theorem for nonnegative tensors
- A regularized semi-smooth Newton method with projection steps for composite convex programs
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Simple algorithms for optimization on Riemannian manifolds with constraints
- On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope
- Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
- SVD based initialization: A head start for nonnegative matrix factorization
- Optimization theory and methods. Nonlinear programming
- An Augmented Lagrangian Function with Improved Exactness Properties
- $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices
- Human-level concept learning through probabilistic program induction
- A Variational Approach to Copositive Matrices
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Adaptive Quadratically Regularized Newton Method for Riemannian Optimization
- Implementing a Smooth Exact Penalty Function for General Constrained Nonlinear Optimization
- A Cone-Continuity Constraint Qualification and Algorithmic Consequences
- Exact Regularization of Convex Programs
- A Continuously Differentiable Exact Penalty Function for Nonlinear Programming Problems with Inequality Constraints
- An exact penalty function method with global convergence properties for nonlinear programming problems
- Two-Point Step Size Gradient Methods
- Spectral Unmixing via Data-Guided Sparsity
- Orthogonal Nonnegative Matrix Factorization by Sparsity and Nuclear Norm Optimization
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Sparse Completely Positive Relaxation of the Modularity Maximization for Community Detection
- Global rates of convergence for nonconvex optimization on manifolds
- New Sequential Optimality Conditions for Mathematical Programs with Complementarity Constraints and Algorithmic Consequences
- Parallelizable Algorithms for Optimization Problems with Orthogonality Constraints
- Structured Quasi-Newton Methods for Optimization with Orthogonality Constraints
- Intrinsic Formulation of KKT Conditions and Constraint Qualifications on Smooth Manifolds
- A Stochastic Semismooth Newton Method for Nonsmooth Nonconvex Optimization
- A Copositive Programming Approach to Graph Partitioning
- Penalty Methods for a Class of Non-Lipschitz Optimization Problems
- Clustering by Orthogonal NMF Model and Non-Convex Penalty Optimization
