Strong global convergence properties of algorithms for nonlinear symmetric cone programming
From MaRDI portal
Cites work
- A Hölder type inequality and an interpolation theorem in Euclidean Jordan algebras
- A log-barrier Newton-CG method for bound constrained optimization with complexity guarantees
- A new polynomial-time algorithm for linear programming
- A new sequential optimality condition for constrained optimization and algorithmic consequences
- An Interior‐Point Trust‐Region Algorithm for General Symmetric Cone Programming
- Augmented Lagrangian methods for the solution of generalized Nash equilibrium problems
- Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
- Constrained composite optimization and augmented Lagrangian methods
- Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras
- Differentiability of the Metric Projection in Hilbert Space
- scientific article; zbMATH DE number 3980094 (Why is no real title available?)
- scientific article; zbMATH DE number 715155 (Why is no real title available?)
- Implementation of interior point methods for mixed semidefinite and second order cone optimization problems
- Interior point methods 25 years later
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Interior-proximal primal-dual methods
- Jordan‐Algebraic Approach to Convexity Theorems for Quadratic Mappings
- Lagrange Multipliers and Optimality
- Local convergence of exact and inexact augmented Lagrangian methods under the second-order sufficient optimality condition
- New Constraint Qualifications for Optimization Problems in Banach Spaces Based on Asymptotic KKT Conditions
- New sequential optimality conditions for mathematical programs with complementarity constraints and algorithmic consequences
- On an algebraic generalization of the quantum mechanical formalism
- On optimality conditions for nonlinear conic programming
- On sequential optimality conditions for smooth constrained optimization
- On the central paths in symmetric cone programming
- On the convergence of augmented Lagrangian strategies for nonlinear programming
- On the use of Jordan algebras for improving global convergence of an augmented Lagrangian method in nonlinear semidefinite programming
- Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary
- Optimality conditions and constraint qualifications for generalized Nash equilibrium problems and their practical implications
- Optimality conditions and global convergence for nonlinear semidefinite programming
- Optimality conditions for nonlinear second-order cone programming and symmetric cone programming
- Optimality conditions for problems over symmetric cones and a simple augmented Lagrangian method
- Practical augmented Lagrangian methods for constrained optimization
- Sequential constant rank constraint qualifications for nonlinear semidefinite programming with algorithmic applications
- Sequential optimality conditions for cardinality-constrained optimization problems with applications
- Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization
- The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited
- Weak notions of nondegeneracy in nonlinear semidefinite programming
This page was built for publication: Strong global convergence properties of algorithms for nonlinear symmetric cone programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969564)
