Pages that link to "Item:Q2576736"
From MaRDI portal
The following pages link to Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization (Q2576736):
Displayed 43 items.
- On how to solve large-scale log-determinant optimization problems (Q288409) (← links)
- An inexact accelerated proximal gradient method and a dual Newton-CG method for the maximal entropy problem (Q353167) (← links)
- An augmented Lagrangian dual optimization approach to the \(H\)-weighted model updating problem (Q396261) (← links)
- A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization (Q429459) (← links)
- Mathematical programs with semidefinite cone complementarity constraints: constraint qualifications and optimality conditions (Q456990) (← links)
- The augmented Lagrangian method for a type of inverse quadratic programming problems over second-order cones (Q458938) (← links)
- First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints (Q463746) (← links)
- A partial proximal point algorithm for nuclear norm regularized matrix least squares problems (Q495943) (← links)
- A perturbation approach for an inverse quadratic programming problem (Q607673) (← links)
- Nonnegative inverse eigenvalue problems with partial eigendata (Q664539) (← links)
- Clarke generalized Jacobian of the projection onto symmetric cones (Q833023) (← links)
- Moreau-Yosida regularization of Lagrangian-dual functions for a class of convex optimization problems (Q839325) (← links)
- Fast Moreau envelope computation I: Numerical algorithms (Q870763) (← links)
- A stochastic model for risk management in global supply chain networks (Q879293) (← links)
- The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming (Q927160) (← links)
- A smoothing Newton method for a type of inverse semi-definite quadratic programming problem (Q953410) (← links)
- A smoothing projected Newton-type algorithm for semi-infinite programming (Q1001204) (← links)
- Properties of equation reformulation of the Karush-Kuhn-Tucker condition for nonlinear second order cone optimization problems (Q1040684) (← links)
- Quadratic convergence of a smoothing Newton method for symmetric cone programming without strict complementarity (Q1928546) (← links)
- Inverse semidefinite quadratic programming problem with \(l_1\) norm measure (Q1987439) (← links)
- On the local convergence of a stochastic semismooth Newton method for nonsmooth nonconvex optimization (Q2082285) (← links)
- Unified convergence analysis of a second-order method of multipliers for nonlinear conic programming (Q2090426) (← links)
- A semismooth Newton-based augmented Lagrangian algorithm for density matrix least squares problems (Q2095559) (← links)
- Jacobian nonsingularity in nonlinear symmetric conic programming problems and its application (Q2217857) (← links)
- Inverse quadratic programming problem with \(l_1\) norm measure (Q2244221) (← links)
- An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems (Q2288192) (← links)
- On the semismoothness of projection mappings and maximum eigenvalue functions (Q2457927) (← links)
- Convergence rate of Newton's method for \(L_2\) spectral estimation (Q2492708) (← links)
- First-Order Optimality Conditions for Mathematical Programs with Second-Order Cone Complementarity Constraints (Q3179271) (← links)
- (Q4642621) (← links)
- Generalized Newton Algorithms for Tilt-Stable Minimizers in Nonsmooth Optimization (Q4989930) (← links)
- (Q5149020) (← links)
- On the characterizations of solutions to perturbed <i>l</i><sub>1</sub> conic optimization problem (Q5384607) (← links)
- Properties and simplifications of constitutive time‐discretized elastoplastic operators (Q5415429) (← links)
- A perturbation approach for an inverse quadratic programming problem over second-order cones (Q5497021) (← links)
- B-Subdifferentials of the Projection onto the Generalized Simplex (Q5865919) (← links)
- A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems (Q5962724) (← links)
- Subdifferential‐based implicit return‐mapping operators in computational plasticity (Q6065078) (← links)
- Finding robust minimizer for non-convex phase retrieval (Q6087986) (← links)
- A semismooth Newton based dual proximal point algorithm for maximum eigenvalue problem (Q6097765) (← links)
- A dual semismooth Newton based augmented Lagrangian method for large-scale linearly constrained sparse group square-root Lasso problems (Q6111345) (← links)
- Globally convergent coderivative-based generalized Newton methods in nonsmooth optimization (Q6126654) (← links)
- (Q6188349) (← links)