Nonlinear rescaling Lagrangians for nonconvex semidefinite programming
From MaRDI portal
Publication:5169465
DOI10.1080/02331934.2013.848861zbMath1291.90168OpenAlexW1978498881MaRDI QIDQ5169465
Publication date: 10 July 2014
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2013.848861
Related Items (3)
Convergence of a weighted barrier algorithm for stochastic convex quadratic semidefinite optimization ⋮ Augmented Lagrangian functions for cone constrained optimization: the existence of global saddle points and exact penalty property ⋮ Convergence analysis of a nonlinear Lagrangian method for nonconvex semidefinite programming with subproblem inexactly solved
Cites Work
- Unnamed Item
- On the solution of large-scale SDP problems by the modified barrier method using iterative solvers
- Properties of the augmented Lagrangian in nonlinear semidefinite optimization
- The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
- Modified barrier functions (theory and methods)
- Nonlinear rescaling vs. smoothing technique in convex optimization
- Über monotone Matrixfunktionen
- Zero duality gap for a class of nonconvex optimization problems
- Primal-dual nonlinear rescaling method with dynamic scaling parameter update
- Multiplier and gradient methods
- PENNON: Software for Linear and Nonlinear Matrix Inequalities
- Unconstrained Lagrangians in Nonlinear Programming
- Nonlinear leastpth optimization and nonlinear programming
- Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming
- Penalty/Barrier Multiplier Methods for Convex Programming Problems
- Variational Analysis
- PENNON: A code for convex nonlinear and semidefinite programming
- Solving nonconvex SDP problems of structural optimization with stability control
- A dual approach to solving nonlinear programming problems by unconstrained optimization
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
- Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
- Definite and Semidefinite Quadratic Forms
- Log-sigmoid multipliers method in constrained optimization
This page was built for publication: Nonlinear rescaling Lagrangians for nonconvex semidefinite programming