On constrained optimization with nonconvex regularization (2021)
- Authors:
- Autor USP: BIRGIN, ERNESTO JULIAN GOLDBERG - IME
- Unidade: IME
- DOI: 10.1007/s11075-020-00928-3
- Subjects: OTIMIZAÇÃO NÃO LINEAR; COMPUTABILIDADE E COMPLEXIDADE
- Keywords: Constrained non-Lipschitz nonsmooth optimization; Complexity analysis; Optimality condition
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título: Numerical Algorithms
- ISSN: 1017-1398
- Volume/Número/Paginação/Ano: v. 86, n. 3, p. 1165-1188, 2021
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
ABNT
BIRGIN, Ernesto Julian Goldberg e MARTÍNEZ, José Mário e RAMOS, Alberto. On constrained optimization with nonconvex regularization. Numerical Algorithms, v. 86, n. 3, p. 1165-1188, 2021Tradução . . Disponível em: https://doi.org/10.1007/s11075-020-00928-3. Acesso em: 09 fev. 2026. -
APA
Birgin, E. J. G., Martínez, J. M., & Ramos, A. (2021). On constrained optimization with nonconvex regularization. Numerical Algorithms, 86( 3), 1165-1188. doi:10.1007/s11075-020-00928-3 -
NLM
Birgin EJG, Martínez JM, Ramos A. On constrained optimization with nonconvex regularization [Internet]. Numerical Algorithms. 2021 ; 86( 3): 1165-1188.[citado 2026 fev. 09 ] Available from: https://doi.org/10.1007/s11075-020-00928-3 -
Vancouver
Birgin EJG, Martínez JM, Ramos A. On constrained optimization with nonconvex regularization [Internet]. Numerical Algorithms. 2021 ; 86( 3): 1165-1188.[citado 2026 fev. 09 ] Available from: https://doi.org/10.1007/s11075-020-00928-3 - An augmented Lagrangian method with finite termination
- Packing circles within ellipses
- Spectral projected gradient and variable metric methods for optimization with linear inequalities
- Sparse Projected-Gradient Method As a Linear-Scaling Low-Memory Alternative to Diagonalization in Self-Consistent Field Electronic Structure Calculations
- The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems
- On acceleration schemes and the choice of subproblem’s constraints in augmented Lagrangian methods
- Penalizing simple constraints on augmented Lagrangian methods
- Dykstra’s algorithm and robust stopping criteria
- Outer trust-region method for constrained optimization
- On the application of an augmented Lagrangian algorithm to some portfolio problems
Informações sobre o DOI: 10.1007/s11075-020-00928-3 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
2999039.pdf | ||
 |
2999039.pdf | Direct link |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
