Improving the Robustness of the Projected Gradient Descent Method for Nonlinear Constrained Optimization Problems in Topology Optimization
Bibliographic record
Abstract
ABSTRACT The Projected Gradient Descent (PGD) algorithm is a widely used and efficient first‐order method for solving constrained optimization problems due to its simplicity and scalability in large design spaces. Building on recent advancements in the PGD algorithm, where an inertial step component has been introduced to improve efficiency in solving constrained optimization problems, this study introduces two key enhancements to further improve the algorithm's performance and adaptability in large‐scale design spaces. First, univariate constraints (such as design variable bounds constraints) are directly incorporated into the projection step via the Schur complement and an improved active set algorithm with bulk constraints manipulation, avoiding issues with min–max clipping. Second, the update step is decomposed relative to the constraint vector space, enabling a post‐projection adjustment based on the state of the constraints and an approximation of the Lagrangian, significantly improving the algorithm's robustness for problems with nonlinear constraints. Applied to a topology optimization problem for heat sink design, the proposed PGD algorithm demonstrates performance comparable to or exceeding that of the Method of Moving Asymptotes (MMA), with minimal parameter tuning. These results position the enhanced PGD as a robust tool for complex optimization problems with large variable spaces, such as topology optimization problems.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".