A concise and friendly introduction to the analysis of algorithms for continuous nonlinear optimization (2025)
- Autor:
- Autor USP: BIRGIN, ERNESTO JULIAN GOLDBERG - IME
- Unidade: IME
- DOI: 10.1007/978-3-031-98455-6_2
- Subjects: OTIMIZAÇÃO NÃO LINEAR; ANÁLISE DE ALGORITMOS
- Language: Inglês
- Imprenta:
- Source:
- Conference titles: Brazil-Portugal Joint Meeting in Mathematics - ECBPM
- Este periódico possui versão em assinatura (ou híbrida)
- Este artigo NÃO possui versão em acesso aberto
- Status do Acesso Aberto: closed
-
ABNT
BIRGIN, Ernesto Julian Goldberg. A concise and friendly introduction to the analysis of algorithms for continuous nonlinear optimization. 2025, Anais.. Cham: Springer, 2025. Disponível em: https://doi.org/10.1007/978-3-031-98455-6_2. Acesso em: 10 mar. 2026. -
APA
Birgin, E. J. G. (2025). A concise and friendly introduction to the analysis of algorithms for continuous nonlinear optimization. In Brazil-Portugal Mathematics. ECBMP 2022 Coimbra Mathematical Texts, v. 4. Cham: Springer. doi:10.1007/978-3-031-98455-6_2 -
NLM
Birgin EJG. A concise and friendly introduction to the analysis of algorithms for continuous nonlinear optimization [Internet]. Brazil-Portugal Mathematics. ECBMP 2022 Coimbra Mathematical Texts, v. 4. 2025 ;[citado 2026 mar. 10 ] Available from: https://doi.org/10.1007/978-3-031-98455-6_2 -
Vancouver
Birgin EJG. A concise and friendly introduction to the analysis of algorithms for continuous nonlinear optimization [Internet]. Brazil-Portugal Mathematics. ECBMP 2022 Coimbra Mathematical Texts, v. 4. 2025 ;[citado 2026 mar. 10 ] Available from: https://doi.org/10.1007/978-3-031-98455-6_2 - 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 a disponibilidade de versões do artigo em acesso aberto coletadas automaticamente via oaDOI API (Unpaywall).
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
3278031.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
